The mixed capacitated general routing problem with turn penalties

Authors:
Olli Bräysy;Eulalia Martínez;Yuichi Nagata;David Soler
Affiliations:
Agora Innoroad Laboratory, Agora Center, P.O. Box 35, FI-40014, University of Jyväskylä, Finland;Institut Universitari de Matemítica Pura i Aplicada, Universitat Politècnica de València, Camí de Vera s/n, 46022 València, Spain;Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology, 4259 Nagatsuta Midori-ku Yokohama, Kanagawa 226-8502, Japan;Institut Universitari de Matemítica Pura i Aplicada, Universitat Politècnica de València, Camí de Vera s/n, 46022 València, Spain
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 9
Cited 1

The design of a computerized sanitation vehicle routing and scheduling system for the town of Oyster Bay, New York

Computers and Operations Research
A capacitated general routing problem on mixed networks

Computers and Operations Research
The Rural Postman Problem on mixed graphs with turn penalties

Computers and Operations Research
The Directed Rural Postman Problem with Turn Penalties

Transportation Science
Lower and upper bounds for the mixed capacitated arc routing problem

Computers and Operations Research
Solving an urban waste collection problem using ants heuristics

Computers and Operations Research
Vehicle Routing for Urban Snow Plowing Operations

Transportation Science
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem

Networks - Route 2007
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Operations Research Letters

A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, such as mail delivery, waste collection and street maintenance operations. Through a polynomial transformation of the considered problem into a Generalized Vehicle routing problem, we suggest a new approach for solving this new problem by transforming it into an Asymmetric Capacitated Vehicle routing problem. In this way, we can solve the new problem both optimally and heuristically using existing algorithms. A powerful memetic algorithm and a set of 336 new benchmark instances are also suggested. The experimental results show that the average deviation of the suggested solution method is less than 0.05% with respect to optimum.