Journal ArticleDOI
Heuristics for the periodic capacitated arc routing problem
Reads0
Chats0
TLDR
These very first algorithms for the PCARP are evaluated on PCARP instances derived from standard CARP benchmarks from literature: the insertion heuristics are very fast but the two-phase method yields better solution costs.Abstract:
The Capacitated Arc Routing Problem (CARP) involves the routing of vehicles to service a set of arcs in a network. This NP-hard problem is extended to a multiperiod horizon, giving a new tactical problem called the Periodic CARP (PCARP). This problem actually occurs in municipal waste collection. Its objective is to assign arcs to periods and to compute the trips in each period, to minimize an overall cost on the horizon. An integer linear program, two insertion heuristics and a two-phase heuristic are developed. These very first algorithms for the PCARP are evaluated on PCARP instances derived from standard CARP benchmarks from literature: the insertion heuristics are very fast but the two-phase method yields better solution costs.read more
Citations
More filters
Journal ArticleDOI
Combinatorial optimization and Green Logistics
TL;DR: The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems.
Posted Content
Combinatorial optimization and Green Logistics
TL;DR: In this paper, the authors introduce the area of green logistics and describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems, particularly considering the topics of reverse logistics, waste management and vehicle routing and scheduling.
Journal ArticleDOI
Combinatorial optimization and Green Logistics
TL;DR: The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be formulated as combinatorial optimization problems.
Journal ArticleDOI
Forty years of periodic vehicle routing
TL;DR: The wide array of circumstances and settings in which the periodic vehicle routing problem has been applied is discussed and the development of solution methods, both exact and heuristic, for the PVRP are described.
Book ChapterDOI
A Decade of Capacitated Arc Routing
TL;DR: A survey of arc routing can be found in this paper, focusing mainly on the Capacitated Arc Routing Problem (CARP), which is the arc routing counterpart to the vehicle routing problem.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
A tabu search heuristic for periodic and multi-depot vehicle routing problems
TL;DR: In this article, a tabu search heuristic was proposed for solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problems.
Journal ArticleDOI
Capacitated arc routing problems
Bruce L. Golden,Richard T. Wong +1 more
TL;DR: The intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems.
Journal ArticleDOI
The period routing problem
TL;DR: The solution obtained for the period vehicle routing problem, the problem of designing vehicle routes to meet required service levels for customers and minimize distribution costs over a given several-day period of time, shows an improvement of 13% over the previous best solution.
Journal ArticleDOI
Computational experiments with algorithms for a class of routing problems
TL;DR: This paper focuses on the development and testing of algorithms for solving the capacitated Chinese postman problem and extensive computational results are presented and analyzed.