The capacitated general windy routing problem with turn penalties

Authors:
Joan C. Micó;David Soler
Affiliations:
-;-
Venue:
Operations Research Letters
Year:
2011

Citing 7
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
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
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	0.00

Visualization

Abstract

In this paper we present the capacitated general windy routing problem with turn penalties. This new problem subsumes many important and well-known arc and node routing problems, and it takes into account turn penalties and forbidden turns, which are crucial in many real-life applications, particularly in downtown areas and for large vehicles. We provide a way to solve this problem both optimally and heuristically by transforming it into a generalized vehicle routing problem.