Hybrid pbkp_redictive control for a dial-a-ride system

Abstract:

In this chapter, we develop a family of solution algorithms based upon computational intelligence for solving the dynamic multi-vehicle pickup and delivery problem. The problem is formulated under a hybrid pbkp_redictive control (HPC) scheme, which considers the pbkp_rediction of the future demand and traffic conditions of the transport system. A generic expression of the system objective function is used to measure the benefits of dispatch decisions of the proposed scheme when solving for more than a two-step-ahead problem under unknown future demand conditions. The demand pbkp_rediction is based on a systematic fuzzy clustering methodology resulting in appropriate probabilities for uncertain future service requests. The potential uncertainty in travel time resulting from unexpected incidents in the transport network is incorporated into the vehicle routing decisions, incorporating the vehicle position and its speed as indicators of traffic conditions. The unpbkp_redictable congestion events generate a more complex dynamic routing problem that is handled through both fault-detection and isolation and fuzzy, fault-tolerant control approaches. Because the dynamic problem considered is NP-hard, we propose the use of evolutionary algorithms that provide near-optimal solutions for one-, two-, and three-step-ahead problems and generate promising results in terms of computation time and accuracy. One extension of the HPC framework is a more generic formulation considering a multi-objective function specification for the dial-a-ride problem under the premise that the dynamic objective should consider two dimensions: user and operator costs. Because these two components are usually directed at opposite goals, the problem is formulated and solved through multi-objective model pbkp_redictive control.

Año de publicación:

2013

Keywords:

Fuente:

scopus