General Arc Routing Problems Solved by a Cutting Plane Algorithm and a Genetic Algorithm
نویسندگان
چکیده
Abstract: This paper considers an extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding realistic constraints like prohibited turns to the basic CARP. Two integer linear models are presented, a mono-objective version and a biobjective one. A cutting plane method for the first version provides either an optimum or a lower bound that are used to benchmark a genetic algorithm on 11 CARP instances from the literature, enriched by additional constraints. The results prove the GA is nearly optimal for these networks with up to 16 nodes and 52 arcs. Copyright © 2002 IFAC
منابع مشابه
Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملA branch & cut algorithm for the windy general routing problem and special cases
In this paper we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut method presented here is based on a cutting-plane algorithm that identifies violated inequalities of several classes of facet-inducing inequalities for the corresponding polyhedron. ...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملNew Models and Methods for Arc Routing
The talk presents two non-standard extensions for singlevehicle arc-routing problems a.k.a. postman problems: First, street segments that require a service on both sides of the street can be covered either by two separate services or by a single zigzag service. Instead of deciding the type of service beforehand, we propose to take into account the zigzagging option when designing a tour. We pre...
متن کاملThe mixed general routing polyhedron
In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed grap...
متن کامل