5,306 Hits in 2.5 sec

The open capacitated arc routing problem

Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França
2011 Computers & Operations Research  
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset  ...  This problem is related to the Capacitated Arc Routing Problem (CARP) but differs from it since OCARP does not consider a depot, and tours are not constrained to form cycles.  ...  Acknowledgements This work was supported by CNPq (Brazilian Research Agency), and IBM (which provided CPLEX 12 license through the IBM Academic Initiative).  ... 
doi:10.1016/j.cor.2011.01.012 fatcat:6d6ve62fjfdo7hkn3uapkxmsca

An Approximation Algorithm for the Capacitated Arc Routing Problem

Sanne Wohlk
2008 Open Operational Research Journal  
In this paper we consider approximation of the Capacitated Arc Routing Problem, which is the problem of servicing a set of edges in a graph using a fleet of capacity constrained vehicles.  ...  We present a 7 3 2 W approximation algorithm for the problem and prove that this algorithm outperforms the only existing approximation algorithm for the problem.  ...  In this paper we will present an algorithm for the Capacitated Arc Routing Problem (CARP) with the triangle inequality preserved by the cost matrix, which is an approximation algorithm with at most the  ... 
doi:10.2174/1874243200802010008 fatcat:cpyvrfx6vrhalm54l6hw57zqke

Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem

Bilal Kanso
2020 International Journal of Artificial Intelligence & Applications  
Arc Routing Problem (MDPOCARP).  ...  In this paper we present a hybrid technique that applies an ant colony optimization algorithm followed by simulated annealing local search approach to solving the Multi-Depot Periodic Open Capacitated  ...  19] [20] and the capacitated arc routing problem CARP [1] .  ... 
doi:10.5121/ijaia.2020.11105 fatcat:wzp726hklbc6bkn6kak6giqgni

Hybrid Algorithm Enhanced with Artificial Intelligence Applied to the Bi-Objective Open Capacitated Arc Routing Problem
Algoritmo memético con operadores de inteligencia artificial para el CARP con inicio y fin no determinado y bi-objetivo

B.J. Macías, C. A. Amaya
2016 Ingeniería y Ciencia  
arc routing problem with a variable starting/ending position (Open Capacitated Arc Routing Problem -OCARP), in its classic version, pursues the best strategy to serve a set of customers located in the  ...  Resumen El Problema de ruteo de vehículos sobre arcos con punto de inicio/fin variable (Open Capacitated Arc Routing Problem -OCARP), en su versión clásica, busca determinar la mejor estrategia para servir  ...  Como una extensión del CARP surge el OCARP (Open Capacitated Arc Routing Problem) en el que la restricción de que todas las rutas deben empezar y terminar en el depósito es omitida.  ... 
doi:10.17230/ingciencia.12.23.2 fatcat:wt2lff25rfbhtdk6vwz534zw34

Multicommodity Network Design Problem in Rail Freight Transportation Planning

Masoud Yaghini, Rahim Akhavan
2012 Procedia - Social and Behavioral Sciences  
Network Design Problem (NDP) is one of the important problems in combinatorial optimization.  ...  Among the network design problems, the Multicommodity Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems.  ...  According to this equation, the objective of the model is to minimize variable cost of commodities flows on arcs, as well as fixed cost of opened arcs.  ... 
doi:10.1016/j.sbspro.2012.04.146 fatcat:2plmrssm6bcxjcvcytzrovcxqm

Heuristic algorithm based on Ant Colony Optimization for the Capacitated Location-Routing problem with Homogeneous Fleet

Gustavo GATICA, Universidad Andres Bello. Chile., John W. ESCOBAR, Rodrigo LINFATI, Universidad del Valle. Colombia, Universidad del del Bio-Bio. Chile
2021 Espacios  
This paper considers the Capacitated Location-Routing Problem with Homogeneous Fleet (CLRP).  ...  The objective is to minimize the sum of the open depots' costs, the costs for the used vehicles, and the costs associated with the distances traveled.  ...  The problem of location routing (LRP) is critical in logistics because it establishes criteria regarding the opening of depots and customers' assignment for a later routing.  ... 
doi:10.48082/espacios-a21v42n16p01 fatcat:lssr2rqq4fhsjbnvlecqymsuna

Decomposition methods for large-scale network expansion problems

Ioannis Fragkos, Jean-François Cordeau, Raf Jans
2021 Transportation Research Part B: Methodological  
Arc opening decisions are taken in every period, and once an arc is opened it can be used throughout the remaining horizon to route several commodities.  ...  For the capacitated variant, we develop an arc-based Lagrange relaxation, combined with local improvement heuristics.  ...  Jennifer Pazour, who provided us with the networks JBH50, USC30 and USC53.  ... 
doi:10.1016/j.trb.2020.12.002 fatcat:sh3xgqhizvhmndlevk72izmovq

A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem

Lyamine Bouhafs, Amir Hajjam, Abderrafiaa Koukam
2008 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing  
In this article we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP).  ...  The experimental results show the efficiency of our approach in comparison with the other methods found in the literature.  ...  Introduction The importance of studying the Capacitated Location Routing Problem (CLRP) is double: in one hand, it is very well-known problem in academic and theoretical research.  ... 
doi:10.1109/snpd.2008.81 dblp:conf/snpd/BouhafsHK08 fatcat:egakyu2scjfxjlrmqzoho64x6u

A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem [chapter]

Lyamine Bouhafs, Amir hajjam, Abder Koukam
2006 Lecture Notes in Computer Science  
In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP).  ...  Location-Routing Problem (LRP) can model several life situations.  ...  Introduction In this paper, we consider the Capacitated Location Routing Problem (CLRP) defined as a combination of two difficult problems: the Facility Location Problem (FLP) and the Vehicle Routing Problem  ... 
doi:10.1007/11892960_50 fatcat:k5plp5k7qfeevgszgtmrae257u

Introduction to Intelligent Decision Support for Logistics and Supply Chain Management Minitrack

Hans-Jurgen Sebastian, Stefan Voss
2014 2014 47th Hawaii International Conference on System Sciences  
Given a network with demands on the arcs the capacitated arc routing problem is to find a set of minimum cost routes for a set of vehicles to service all arcs with positive demands without violating the  ...  The second paper deals with Decision Support for Capacitated Arc Routing for Providing Municipal Waste and Recycling Services.  ...  Given a network with demands on the arcs the capacitated arc routing problem is to find a set of minimum cost routes for a set of vehicles to service all arcs with positive demands without violating the  ... 
doi:10.1109/hicss.2014.129 dblp:conf/hicss/SebastianV14 fatcat:fksha73pcfcezebrjicrmij5ja

Introducing radiality constraints in capacitated location-routing problems

Eliana Mirledy Toro Ocampo, Frederico G. Guimarães, Ramón Alfonso Gallego Rendón
2017 International Journal of Industrial Engineering Computations  
In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP) and for the Capacitated Location Routing Problem (CLRP), adopting radiality constraints  ...  in order to guarantee valid routes and eliminate subtours.  ...  This model can be adapted to open routing problems, closed routing problems and combinations of these.  ... 
doi:10.5267/j.ijiec.2017.3.004 fatcat:mafwlfio35c7rfol36flqxyg3e

Page 534 of The Journal of the Operational Research Society Vol. 56, Issue 5 [page]

2005 The Journal of the Operational Research Society  
A cutting plane algorithm for the capacitated arc routing problem. Comput Opns Res 30(5): 705-728. Eglese RW and Li LYO (1996).  ...  A tabu search heuristic for the capacitated arc routing problem. Opns Res 48: 129-135. Gendreau M, Laporte G and Seguin R (1995).  ... 

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar, Rahim Akhavan
2011 International Journal of Applied Metaheuristic Computing  
The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem.  ...  Several strategies for opening and closing arcs are proposed and evaluated.  ...  ., must be routed between different points of origin and destination on the limited capacity arcs.  ... 
doi:10.4018/jamc.2011100102 fatcat:ubkhr2csh5byhmufokxoudm43e

Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

Evi Yuliza, Fitri Maya, Siti Suzlin Supadi
2021 Science and Technology Indonesia  
Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays.  ...  The RCOCVRP model with time windows to optimize the route problems of waste transport vehicles that is solved using the cheapest insertion heuristics algorithm is more effective than the nearest neighbor  ...  Classic vehicle routing problem, also known as capacitated vehicle routing problem, has the characteristic that the vehicle departs from the starting point and returns to the starting point for example  ... 
doi:10.26554/sti.2021.6.2.53-57 fatcat:jpoyl73sfzfadkrje6b44nzkiq

Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau
2003 Operations Research  
Moves are identified through a shortest path-like network optimization procedure and proceed by re-directing flow around cycles and closing and opening design arcs accordingly.  ...  Résumé Nous proposons une nouvelle structure de voisinages pour les méta-heuristiques dédiées au problème de synthèse de réseau multiproduits avec capacités.  ...  and Computation, and by the Fonds F.C.A.R. of the Province of Québec.  ... 
doi:10.1287/opre.51.4.655.16098 fatcat:xnamyzu3fjdt7ldjye5pcomonm
« Previous Showing results 1 — 15 out of 5,306 results