Results 161 to 170 of about 7,519,682 (194)
Some of the next articles are maybe not open access.
OPSEARCH, 2001
Location-Arc Routing Problems (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversai of a subset of edges and arcs of a graph and to also locate facilities on the graph. The main LARP applications arise in the areas of postal delivery, garbage collection and road maintenance. This article surveys the main LARP
GHIANI, GIANPAOLO, G. LAPORTE
openaire +2 more sources
Location-Arc Routing Problems (LARPs) are encountered in contexts where it is necessary to simultaneously determine a traversai of a subset of edges and arcs of a graph and to also locate facilities on the graph. The main LARP applications arise in the areas of postal delivery, garbage collection and road maintenance. This article surveys the main LARP
GHIANI, GIANPAOLO, G. LAPORTE
openaire +2 more sources
A warehouse location-routing problem
Transportation Research Part B: Methodological, 1985Abstract The interdependence between distribution center location and vehicle routing has been recognized by both academics and practitioners. However, only few attempts have been made to incorporate routing in location analysis. This paper defines the Warehouse Location-Routing Problem (WLRP) as one of simultaneously solving the DC location and ...
Jossef Perl, Mark S. Daskin
openaire +1 more source
Solving location and routing problem for UAVs
Computers & Industrial Engineering, 2016A variant of LRP is introduced to optimize location and routing of UAV fleet.Problem is characterized by a prize collecting objective function.An ant colony optimization metaheuristic is developed to solve the problem.Most instances are found difficult to solve optimally using a commercial solver.Proposed metaheuristic can find close to the best known ...
openaire +2 more sources
A Metaheuristic for a Two Echelon Location-Routing Problem
2010In this paper we consider the design problem of a two-echelon freight distribution system. The aim is to define the structure of a system optimizing the location and the number of two different kinds of facilities, the size of two different vehicle fleets and the related routes on each echelon.
Maurizio Boccia +3 more
openaire +3 more sources
Some recent contributions to routing and location problems
Networks, 2003AbstractThis report is more than just a summary of some results of the present state of the art in routing and location problems. It summarizes theoretical insights, modeling approaches, and heuristic and exact algorithms for routing and location presented at the CORAL 2003 Workshop held in Tenerife (Spain). © 2003 Wiley Periodicals, Inc.
Angel Corberán +2 more
openaire +2 more sources
A Metaheuristic for the Periodic Location-Routing Problem
2008The well-known Vehicle Routing Problem (VRP) has been generalized toward tactical or strategic decision levels of companies but not both. The tactical extension or Periodic VRP (PVRP) plans trips over a multi-period horizon, subject to frequency constraints.
openaire +4 more sources
A “Locate First - Route Second” Heuristic for a Combined Location-Routeing Problem
1997We consider a two-stage facility location problem where on the second distribution stage, delivery vehicles operate on routes. The objective is to find the number, size and locations of the depots, together with the allocation of customers and the product flow from the plants to the depots, which minimize the sum of the trunking costs, variable and ...
Arno Bruns, Andreas Klose
openaire +1 more source
The hub location and routing problem
European Journal of Operational Research, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Hybrid heuristics for the inventory-location-routing problem
4OR, 2014Solving the Inventory Location-Routing Problem can been seen as an approach to optimize both a supply chain design and its operations costs. Assumptions consider that vehicles might visit more than one retailer per route and that inventory management decisions are included for a multi-depot, multi-retailer system with storage capacity over a discrete ...
openaire +1 more source
This bachelor's thesis deals with the formula琀椀on and solu琀椀on approaches to the Loca琀椀on Rou琀椀ng Problem (LRP), a computa琀椀onally demanding task in the 昀椀eld of combinatorial op琀椀miza琀椀on. The main focus is placed on a two-phase tabu search metaheuris琀椀c, implemented in a custom object-oriented model design in the Python programming language.
openaire +1 more source
openaire +1 more source