A genetic algorithm for the simultaneous delivery and pickup problems with time window

Wang, Hsiao‐Fan; Chen, Ying-Yen

doi:10.1016/j.cie.2011.08.018

Cited by 151 publications

(141 citation statements)

References 25 publications

Supporting

Mentioning

135

Contrasting

Unclassified

Order By: Relevance

“…From a mathematical point of view, VRPSPDTW is a NP-hard combinatorial optimization problem which means that exact algorithms can only be used to find solutions for small-and-medium scale instances. The commercial linear programming software CPLEX has been reported to solve the VRPSPDTW problem executed on an Intel Core2 Quad 2.4G computer with 1G memory, and was only able to solve a 10 customer instance, and a portion of 25 and 50 customer scenarios [2]. For the solved instance RCdp 1004 (10 customers instance) and RCdp5001 (50 customers instance), the computation time was 1503 seconds and 327,404 seconds respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows

Wang

Zhao²,

et al. 2013

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract.A variant of vehicle routing problem in which customers require simultaneous pickup and delivery goods during specific individual time windows (VRPSPDTW) is addressed. A general mixed integer programming model focused on minimizing the number of vehicles is proposed. A simulated annealing (SA) algorithm is developed and applied to solve this NP-hard optimization problem. Computational results are reported for a set of 15 test problems from Wang and Chen's benchmark and compared with the results from a genetic algorithm (GA). It is shown that SA is an effective metaheuristic to solve the VRPSPDTW.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Boubahri et al [5] constructed a multi-agent colonies algorithm for this problem, but did not test with the instances. Wang and Chen [2] proposed a co-evolution genetic algorithm with variants of the cheapest insertion method for VRPSPDTW. They also developed 65 instances revised from the well-known Solomon benchmark [6] for VRPTW.…”

Section: Introductionmentioning

confidence: 99%

Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows

Wang

Zhao²,

et al. 2013

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…In the recent years, several meta-heuristic algorithms have been well developed for solving the NP-hard vehicle routing problems, such as Simulated Annealing algorithms [5], Tabu Searches, Genetic Algorithms [6]. For effectively use of each meta-heuristic, a set of design parameters should be tested and fine-tuned.…”

Section: Heuristic Algorithmsmentioning

confidence: 99%

Vehicle Routing Problem with Simultaneous Pickup and Delivery in Cross-Docking Environment

Huang¹,

Liu²

2015

JOEBM

View full text Add to dashboard Cite

Abstract-This study will discuss the vehicle routing problem with simultaneous pickup and delivery in a cross-docking environment. The transportation system includes three stages: (1) pickup goods, (2) delivery goods and pickup returned goods, and (3) delivery all returned goods. In the second stage, some operations of stage (3) may be accepted if time and loading capacity are available. We believe this special design can further reduce the transportation cost. A mathematical model is developed. The objective of this model is to minimize overall transportation cost including the vehicle transportation cost and the fixed cost of each route. An appropriate heuristic algorithm for solving the problem is also developed by using Tabu logic. Result of numerical example indicates that the proposed three-stage transportation system and heuristic algorithm can solve the vehicle routing problem effectively and efficiently.Index Terms-Cross-docking, pickup and delivery, vehicle routing problem.

show abstract

“…For the VRPMB with time windows, (Hasama, et al, 1998) (Kontoravdis and Bard, 1995) (Zhong and Cole, 2005) designed heuristics, with the primary objective of minimizing the number of the vehicles and the second objective of minimizing traveling distances. For the most complex one, VRPSDPTW, only (Angelelli and Mansini, 2002) proposed an exact method and (Mingyong and Erbao, 2010) and (Wang and Chen, 2012) proposed genetic algorithms.…”

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

248

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

A genetic algorithm for the simultaneous delivery and pickup problems with time window

Cited by 151 publications

References 25 publications

Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows

Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows

Vehicle Routing Problem with Simultaneous Pickup and Delivery in Cross-Docking Environment

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

Contact Info

Product

Resources

About