Solving capacitated arc routing problems using a transformation to the CVRP
TL;DR: The paper shows that this approach can be effective and, in particular, that the original instances may generate node routing instances that behave as if the size is not increased, by slightly modifying the well-known transformation by Pearn, Assad and Golden from capacitated arc routing problem to the capacitated vehicle routing problem (CVRP).
read more
About: This article is published in Computers & Operations Research. The article was published on 01 Jun 2006. and is currently open access. The article focuses on the topics: Arc routing & Vehicle routing problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa,Humberto J. Longo,Jens Lysgaard,Marcus Poggi de Aragão,Marcelo L. Reis,Eduardo Uchoa,Renato F. Werneck +6 more
TL;DR: This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints.
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.
240
Persistent UAV delivery logistics: MILP formulation and efficient heuristic
TL;DR: A Mixed Integer Linear Programming (MILP) formulation for derivation of persistent UAV delivery schedules is proposed and a Receding Horizon Task Assignment (RHTA) heuristic is developed and tested with numerical examples for island-area delivery.
233
Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems
TL;DR: Experimental results show that MAENS is superior to a number of state-of-the-art algorithms, and the advanced performance ofMAENS is mainly due to the MS operator, which is capable of searching using large step sizes and is less likely to be trapped in local optima.
References
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
- 01 Jan 2001
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
4.2K
A new branch-and-cut algorithm for the capacitated vehicle routing problem
TL;DR: A new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP) that uses a variety of cutting planes, including capacity, framed capacity, generalized capacity, strengthened comb, multistar, partialMultistar, extended hypotour inequalities, and classical Gomory mixed-integer cuts is presented.
683
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa,Humberto J. Longo,Jens Lysgaard,Marcus Poggi de Aragão,Marcelo L. Reis,Eduardo Uchoa,Renato F. Werneck +6 more
TL;DR: This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints.
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
TL;DR: In this paper, the authors considered the problem of routing vehicles to supply customers with known demands, in such a way as to minimize the total distance traveled, which is referred to as the vehicle routing problem (VRP).
587
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.
551