Author
I-Ming Chao
Other affiliations: University of Maryland, College Park
Bio: I-Ming Chao is an academic researcher from Military Academy. The author has contributed to research in topics: Vehicle routing problem & Heuristic. The author has an hindex of 8, co-authored 8 publications receiving 1546 citations. Previous affiliations of I-Ming Chao include University of Maryland, College Park.
Papers
More filters
TL;DR: A fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points and the computational results are presented in detail.
488 citations
01 Jan 1998
TL;DR: In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot so that all customers are serviced and the total distance traveled by the fleet is minimized.
Abstract: In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot. Each vehicle has a fixed capacity that cannot be exceeded and each customer has a known demand that must be satisfied. Each customer must be serviced by exactly one visit of a single vehicle and each vehicle must leave and return to the depot. There may be route-length restrictions that limit the distance traveled by each vehicle. The objective is to generate a sequence of deliveries for each vehicle so that all customers are serviced and the total distance traveled by the fleet is minimized.
340 citations
01 Jan 1996
TL;DR: A fast and extremely effective heuristic is presented and tested on 67 problems taken from the literature and 40 new test problems and the computational results are presented in detail.
Abstract: In the orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time, the goal is to determine a path from the start point to the end point through a subset of locations in order to maximize the total path score. In this paper, a fast and extremely effective heuristic is presented and tested on 67 problems taken from the literature and 40 new test problems. The computational results are presented in detail.
303 citations
TL;DR: In this paper, a fast and extremely effective heuristic is presented and tested on 67 problems taken from the literature and 40 new test problems and the computational results are presented in detail.
302 citations
TL;DR: This work has improved upon best-known solutions to problems from the literature using a new heuristic procedure that works well on 19 newly generated test problems.
Abstract: In the period vehicle routing problem, each customer requires a certain number of deliveries per week. Given these frequency requirements, customers must be allocated to days. A vehicle routing problem is solved over each day. We have improved upon best-known solutions to problems from the literature using a new heuristic procedure. The heuristic also works well on 19 newly generated test problems.
153 citations
Cited by
More filters
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.
1,282 citations
TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.
1,019 citations
TL;DR: A GA without trip delimiters, hybridized with a local search procedure is proposed, which outperforms most published TS heuristics on the 14 classical Christofides instances and becomes the best solution method for the 20 large-scale instances generated by Golden et al.
974 citations
TL;DR: The OP is formally described and many relevant variants are presented and all published exact solution approaches and (meta) heuristics are discussed and compared.
882 citations
TL;DR: In this article, the authors provide a brief account of the development in the field of exact algorithms and heuristics for the VRP and present a metaheuristic for the problem.
Abstract: The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.
785 citations