A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

Madsen, Oli B.G.; Ravn, Hans F.; Rygaard, Jens Moberg

doi:10.1007/bf02031946

Cited by 238 publications

(118 citation statements)

References 14 publications

Supporting

Mentioning

108

Contrasting

Unclassified

Order By: Relevance

“…Static versions of the dial-a-ride problem (DARP) are described for instance in Psaraftis (1983), Jaw et al (1986), Ioachim et al (1995), Borndörfer et al (1997), Toth and Vigo (1997), Fu (2002a), Cordeau and Laporte (2003b) and Cordeau (2006). In the dynamic mode, described for example in Madsen et al (1995), Teodorovic and Radivojevic (2000), Colorni and Righini (2001) and Attanasio et al (2004), the number of requests gradually increases as the customers call in requests, and the planning starts before all requests are known. However, the modeling of the dynamic case is in many ways similar to the modeling of the static case.…”

Section: Modeling and Simulation Of Darpmentioning

confidence: 99%

A modeling system for simulation of dial-a-ride services

Häll

Högberg²,

Lundgren

2012

Public Transp

View full text Add to dashboard Cite

We present a modeling system for simulation of dial-a-ride services. It can be used as a tool for understanding and study how different designs, and different ways to operate a dial-a-ride service, affect the performance and efficiency of the service. The system simulates the operation of a dynamic dial-a-ride service that operates with multiple fleets of vehicles with different capacities, schedules and depots. It can be used to investigate how the setting of service and cost parameters and the design of the service affect the total cost for the operator and level of service for the customer. We describe the different modules in the system and the possible uses of the system. A short simulation study is performed to exemplify how it can be used. In this study the effects of including costs for customer discomfort are evaluated.

show abstract

Section: Modeling and Simulation Of Darpmentioning

confidence: 99%

A modeling system for simulation of dial-a-ride services

Häll

Högberg²,

Lundgren

2012

Public Transp

View full text Add to dashboard Cite

show abstract

“…Results are reported on simulated data of 250 users and on real data from Friedrichschafen, Germany, involving 2617 users. Madsen et al (1995) solved a real-life problem involving scheduling services for elderly and disabled people in Copenhagen, Denmark. The problem is characterized by time windows, multiple capacities and multiple objectives.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The DARP consists of constructing a set of feasible minimum cost routes. A common application of the DARP arises in door-to-door transportation of the elderly and the disabled (Madsen et al 1995, Ioachim et al 1995, Borndörfer et al 1997, Toth and Vigo 1997.…”

Section: Introductionmentioning

confidence: 99%

Local search heuristics for the probabilistic dial-a-ride problem

Haugland

2009

OR Spectrum

View full text Add to dashboard Cite

This paper describes an efficient neighborhood search procedure for the probabilistic dial-a-ride problem. This procedure requires O(n 4 ) computations compared to O(n 6 ) if computed from scratch. Two heuristics with this search procedure embedded are developed for solving the problem: a tabu search heuristic and a hybrid GRASP-tabu search heuristic. Computational results show that tabu search is superior over GRASP-tabu search on the probabilistic dial-a-ride problem, and by incorporating the search technique resulted in faster heuristics.

show abstract

“…In their study, a neural network was constructed based on historic decisions of human dispatchers. Madsen et al (1995) suggested a heuristic algorithm for a dial-a-ride problem, which is one example of a dynamic vehicle-routing problem. Ichoua et al (2000) addressed a real-time vehicle-dispatching problem with a diversion possibility in which diverting a vehicle away from its current destination in response to a new customer request is allowed.…”

Section: Introductionmentioning

confidence: 99%

An Auction-Based Dispatching Method for an Electronic Brokerage of Truckload Vehicles

Lee¹,

Kim²

2015

Industrial Engineering and Management Systems

View full text Add to dashboard Cite

This study suggests an electronic brokerage system that has the capability of efficiently matching dispatching delivery tasks with trucks. In the brokerage system, individual truck drivers and shippers are allowed to participate in the dispatching process through the internet or wireless communication. An auction-based dispatching method for the electronic brokerage system is suggested. The basic rationale of the auction-based dispatching method-which is a distributed decision-making process-is discussed. The performance of the suggested algorithms is evaluated by a simulation study.

show abstract

A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

Cited by 238 publications

References 14 publications

A modeling system for simulation of dial-a-ride services

A modeling system for simulation of dial-a-ride services

Local search heuristics for the probabilistic dial-a-ride problem

An Auction-Based Dispatching Method for an Electronic Brokerage of Truckload Vehicles

Contact Info

Product

Resources

About