Results 11 to 20 of about 7,596,422 (242)

The green location-routing problem [PDF]

open access: yesComputers & Operations Research, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Okan Dukkanci   +2 more
openaire   +4 more sources

A New Approach to Location Routing Problem: Capacitated Periodic Location Routing Problem with Inventory

open access: yes, 2020
Integration of the Facility Location Problem (FLP) and the Vehicle Routing Problem (VRP) is called the Location-Routing Problem (LRP). In this study, using the real data of a food processing company, the best warehouse locations and the customers who are served by these warehouses are tried to be determined by a new mixed-integer formulation in which ...
YAŞAR BOZ, Esra   +2 more
openaire   +3 more sources

Location routing problems on trees [PDF]

open access: yesDiscrete Applied Mathematics, 2019
This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The formulation models a directed forest where each connected component hosts at least one open facility, which becomes the root of the ...
Aráoz Durand, Julián Arturo   +2 more
openaire   +3 more sources

A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP) [PDF]

open access: yes, 2005
The Capacitated Arc Routing Problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified roads.
Eglese, R W, Brandao, J
core   +4 more sources

Disruption management of the vehicle routing problem with vehicle breakdown [PDF]

open access: yes, 2011
This paper introduces a new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan.
Eglese, R W, Mu, Q, Fu, Z, Lysgaard, J
core   +4 more sources

Location-Routing: Issues, Models and Methods [PDF]

open access: yes, 2006
This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and look at a number of problem variants. Both exact and heuristic algorithms
Gábor Nagy   +3 more
core   +1 more source

A multi-facility AGV location-routing problem with uncertain demands and planar facility locations [PDF]

open access: yesJournal of Applied Research on Industrial Engineering, 2021
The Location Routing Problem (LRP), Automatic Guided Vehicle (AGV), and Uncertainty Planner Facility (UPF) in Facility Location Problems (FLP) have been critical. This research proposed the role of LRP in Intelligence AGV Location–Routing Problem (IALRP)
Mohamad Ebrahim Tayebi Araghi   +3 more
doaj   +1 more source

Urban Transportation Network Design for Fresh Fruit and Vegetables Using GIS–The Case of Bangkok

open access: yesApplied Sciences, 2019
A cold chain for perishable fresh products aims to preserve the quality of the products under the control of a predefined temperature range. To satisfy the delivery conditions within appropriate time windows, the most critical operations in cold chain ...
Juthathip Suraraksa, Kwang Sup Shin
doaj   +1 more source

POPMUSIC for the world location-routing problem [PDF]

open access: yesEURO Journal on Transportation and Logistics, 2013
POPMUSIC—partial optimization metaheuristic under special intensification conditions—is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labelling.
Adriana C. F. Alvim, Éric D. Taillard
openaire   +2 more sources

Exploiting sparsity in pricing routines for the capacitated arc routing problem [PDF]

open access: yes, 2008
The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price.
Oukil, A   +3 more
core   +4 more sources

Home - About - Disclaimer - Privacy