Results 211 to 220 of about 7,596,422 (242)
Some of the next articles are maybe not open access.
Applied Soft Computing Journal, 2015
Graphical abstractDisplay Omitted HighlightsAn improved variant of the particle swarm optimization algorithm is presented.A new formulation of the location routing problem with stochastic demands is given.A new neighborhood topology for PSO suitable for combinatorial optimization problems is proposed.The proposed algorithm is tested in the CLRP and in ...
Yannis Marinakis
exaly +3 more sources
Graphical abstractDisplay Omitted HighlightsAn improved variant of the particle swarm optimization algorithm is presented.A new formulation of the location routing problem with stochastic demands is given.A new neighborhood topology for PSO suitable for combinatorial optimization problems is proposed.The proposed algorithm is tested in the CLRP and in ...
Yannis Marinakis
exaly +3 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
A two-echelon location-routing problem with synchronisation
Journal of the Operational Research Society, 2019Motivated by an actual problem of a national postal service company, we introduce and define a new two-echelon location-routing problem (2E-LRP).
Seyed Mostafa Mirhedayatian +3 more
openaire +2 more sources
Nested Heuristic Methods for the Location-Routeing Problem
Journal of the Operational Research Society, 1996Summary: The concept of `nested methods' is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired ...
Nagy, G., Salhi, S.
openaire +1 more source
Flexible two-echelon location routing problem
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maryam Darvish +3 more
openaire +3 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
Combined location-routing problems—a neural network approach
Annals of Operations Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Schwardt, Kathrin Fischer
openaire +4 more sources
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
A General Solution Approach for the Location Routing Problem
2018Conventional solution methods for logistics optimization problems often have to be adapted when objectives or restrictions of organizations in logistics environments are changing. In this paper, a new, generic solution approach called optimization network (ON) is developed and applied to a logistics optimization problem, the Location Routing Problem ...
Viktoria A. Hauder +4 more
openaire +1 more source
Analysis of vehicle emissions in location-routing problem
Flexible Services and Manufacturing Journal, 2018This paper analyses the joint impact of depot location and routing decisions on emissions in freight transportation. We study a variant of the location-routing problem by considering environmental objectives and time windows. The aim is to minimize the sum of depot cost, driver cost, and the cost of fuel and CO2 emissions.
openaire +3 more sources