A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Diana, Marco; Dessouky, Maged

doi:10.1016/j.trb.2003.07.001

Cited by 188 publications

(105 citation statements)

References 40 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Meanwhile, many heuristics have proposed for the PDPTW. (Jaw, et al, 1986), (Madsen, et al, 1995), (Diana and Dessouky, 2004), (Lu and Dessouky, 2006) presented various insertion-based heuristics for solving the PDPTW. (P. Toth and Vigo, 1997b) (Nanry and Wesley Barnes, 2000) (J.-F. Cordeau and Laporte, 2003) solved the PDPTW by means of tabu search heuristics.…”

Section: Literature Reviewmentioning

confidence: 99%

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Liu

Xie

Augusto

et al. 2013

European Journal of Operational Research

240

View full text Add to dashboard Cite

International audienceThis paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital to patient, pickup from a patient to depot and pickup from a patient to a medical lab. Each patient is visited by one vehicle and each vehicle visits each node at most once. Patients are associated with time windows and vehicles with capacity. Two mixed-integer programming models are proposed. We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search. The TS is based on route assignment attributes of patients, an augmented cost function, route re-optimization, and attribute-based aspiration levels. These approaches are tested on test instances derived from existing VRPTW benchmarks

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Liu

Xie

Augusto

et al. 2013

European Journal of Operational Research

240

View full text Add to dashboard Cite

show abstract

“…Experiments are made on instances of 50 to 250 requests, as well as on a real-life problem consisting of 2545 requests. Diana and Dessouky (2004) present a parallel regret insertion heuristic to solve large instances of the DARP. Data sets of 500 and 1000 requests are tested.…”

Section: Literature Reviewmentioning

confidence: 99%

The Integrated Dial-a-Ride Problem

et al. 2008

View full text Add to dashboard Cite

In this paper we present a formulation of the Integrated Dial-a-Ride Problem (IDARP). This problem is to schedule dial-a-ride requests, where some part of each journey may be carried out by a fixed route service. The IDARP is a generalization of the Dial-a-Ride Problem. An arc-based formulation is proposed, and it is shown how the model can be made easier to solve by arc elimination, variable substitution and the introduction of subtour elimination constraints. Small instances of the IDARP can be solved using an exact solution method, and one such instance is studied. We also describe how input and output data can be created and visualized in a geographic information system.

show abstract

“…Traffic control problems [6] and demand bus services [4] are common examples in the agent research community. Multiagent-based simulation for demand responsive bus services is straightforward: we first define an interaction protocol between passengers and bus companies, run simulation with agents that simulate passengers, bus drivers and bus companies.…”

Section: Example: Mega Navigationmentioning

confidence: 99%

“…From the results of the participatory simulation, we can improve the models of service agents and users, as well as the interaction protocols. 4. Perform experiments in a real space to try out the entire system with human subjects.…”

Section: Introductionmentioning

confidence: 99%

Society-Centered Design for Socially Embedded Multiagent Systems

Ishida

2004

Cooperative Information Agents VIII

View full text Add to dashboard Cite

Abstract.To realize large-scale socially embedded multiagent systems, this paper proposes a new system design methodology towards society-centered design. We have already developed the scenario description language Q, which describes interaction protocols that link agents to society. Using the virtual space called FreeWalk, wherein agents behave under given Q scenarios, we explain each step of society-centered design. The process consists of participatory simulation, where agents and human-controlled avatars coexist in virtual space to jointly perform simulations, and augmented experiment, where an experiment is performed in real space by human subjects, scenariocontrolled agents, and human extras. As an application of society-centered design, we are working on mega navigation, where millions of humans and socially embedded agents collaborate for developing services for traffic control, crisis management and large-scale event navigation.

show abstract

A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Cited by 188 publications

References 40 publications

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

The Integrated Dial-a-Ride Problem

Society-Centered Design for Socially Embedded Multiagent Systems

Contact Info

Product

Resources

About