Filters








593 Hits in 5.4 sec

A Survey Of Discrete Facility Location Problems

Z. Ulukan, E. Demircioğlu
2015 Zenodo  
A brief, elucidative table based on a grouping according to "General Problem Type" and "Methods Proposed" used in the studies is also presented at the end of the work.  ...  Facility location is a complex real-world problem which needs a strategic management decision.  ...  Their purpose was to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure.  ... 
doi:10.5281/zenodo.1108651 fatcat:svz4w677anchhewav4pf6qxwjq

A review on the electric vehicle routing problems: Variants and algorithms

Hu Qin, Xinxin Su, Teng Ren, Zhixing Luo
2021 Frontiers of Engineering Management  
For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.  ...  The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP  ...  We are grateful to the Chinese government and all the people who supported the first author.  ... 
doi:10.1007/s42524-021-0157-1 fatcat:c2psznaxqjdrtc2evrgpoatrd4

Concave minimum cost network flow problems solved with a colony of ants

Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes
2012 Journal of Heuristics  
The problems we have used to test the algorithm were previously solved by other authors using other population based heuristics.  ...  Our goal is not only to apply an Ant Colony Optimization (ACO) algorithm to such a problem, but also to provide an insight on the behaviour of the parameters in the performance of the algorithm.  ...  of such ratios are the main parameter in defining problem difficulty for fixed-charge MCNFPs.  ... 
doi:10.1007/s10732-012-9214-6 fatcat:i3ohsxfgcfguneaifjwmsvy23i

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Tomislav Erdelić, Tonči Carić
2019 Journal of Advanced Transportation  
An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.  ...  Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted.  ...  Acknowledgments The research has been supported by the European Regional Development  ... 
doi:10.1155/2019/5075671 fatcat:tmslmxzeqvc23e3jaxrpfc54ki

A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem [chapter]

P. C. Pop, O. Matei, C. Pop Sitar, C. Chira
2010 Lecture Notes in Computer Science  
Solving the Generalized Vehicle Routing Problem an efficient transformation of the GVRP into a Capacitated Arc Routing Problem (CARP) (Ghiani and Improta [1] ); an ant colony based algorithm (Pop et  ...  Improvement heuristics The improvement heuristics algorithms for the GVRP are based on simple routes modifications and may operate on each vehicle route taken separately, or on a several routes at a time  ...  Computational results The performance of the proposed GA for GVRP was tested on seven benchmark problems drawn from TSPLIB. The testing machine was an Intel Dual-Core 1,6 GHz and 1 GB RAM.  ... 
doi:10.1007/978-3-642-13803-4_15 fatcat:tjin6mvvargztai335nhpqyknm

An improved hybrid algorithm for capacitated fixed-charge transportation problem

C.-M. Pintea, P. C. Pop
2015 Logic Journal of the IGPL  
Pop, A Hybrid Classical Approach to a Fixed-Charge Transportation Problem, in Proc. of HAIS 2012, Part I, Editors E.  ...  Pop, A Hybrid Classical Approach to a Fixed-Charge Transportation Problem, in Proc. of HAIS 2012, Part I, Editors E.  ... 
doi:10.1093/jigpal/jzv014 fatcat:6boxa6wgmzelpdg5ovbxrteebu

Lagrangian Relaxation for an Inventory Location Problem with Periodic Inventory Control and Stochastic Capacity Constraints

Claudio Araya-Sassi, Pablo A. Miranda, Germán Paredes-Belmar
2018 Mathematical Problems in Engineering  
We studied a joint inventory location problem assuming a periodic review for inventory control.  ...  We propose a solution approach based on a Lagrangian relaxation and the subgradient method.  ...  This MINLP model is NP-hard because it is an extension of the Capacitated Facility Location Problem (CFLP), which is already NP-hard.  ... 
doi:10.1155/2018/8237925 fatcat:ag4sr7o2ufh4jf3i6hwjsfacvy

Solving an urban waste collection problem using ants heuristics

Joaquín Bautista, Elena Fernández, Jordi Pereira
2008 Computers & Operations Research  
We also present the ant colonies heuristics that we have used to obtain the solutions to the problem.  ...  We present the model that we have built for the problem, which results after an appropriate transformation of the problem into a node routing one.  ...  Acknowledgements The research of the first and the third author has been partially supported through the Spanish CICYT grant BEC2003-03809.  ... 
doi:10.1016/j.cor.2007.01.029 fatcat:tdv2ehvfxjfutilvei63yry2jq

A HYBRID LAGRANGIAN HEURISTIC/SIMULATED ANNEALING ALGORITHM FOR THE MULTI-DEPOT LOCATION ROUTING

Chia-Ho CHEN, Ching-Jung TING
2007 Journal of the Eastern Asia Society for Transportation Studies  
Then an independent vehicle routing problem (VRP) for each selected facility location is solved by SA. Finally, the SA is used to perform a global search for all routing moves.  ...  In this research, a three-phase hybrid heuristic approach (LH-SA), combining the Lagrangian heuristic (LH) and simulated annealing (SA), is developed to solve the multi-depot location routing problem (  ...  The proposed LH is revised based on the LH for capacitated facility location problem in Daskin (1995) and its procedures are introduced as follows.  ... 
doi:10.11175/easts.7.961 fatcat:yjw4a3l74vg7jovybnt6g4oyyq

A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem

J A Díaz, E Fernández
2002 Journal of the Operational Research Society  
Reactive grasp and tabu search heuristics for the single source capacitated plant location problem. /nform Systems Opl Res 37: 194-225.  ...  This approach is based on a Lagrangean heuristic that includes a strong primal heuristic based on repeated matching.  ... 
doi:10.1057/palgrave.jors.2601353 fatcat:wx7trvmbxzhllbcaqpwtbbjwl4

Allocation search methods for a generalized class of location–allocation problems

Martin Bischoff, Kerstin Dächert
2009 European Journal of Operational Research  
Each object is associated with a convex cost function, specifying the expenses for serving the object from any location in the plane.  ...  For the resulting multi-dimensional mixed-integer optimization problem, we compare various traditional and new search methods.  ...  For example, Jaramillo et al. [2002] evaluates the performance of genetic algorithms for the (un-)capacitated fixed charge problem, the maximum covering problem and the medianoid and centroid problem  ... 
doi:10.1016/j.ejor.2007.10.022 fatcat:vqssr5cnmzai7h7ffmnew4copi

Dynamic Mean Value Cross Decomposition Algorithm for Capacitated Facility Location Problems

Chulyeon KIM, Gyunghyun CHOI, Sung-Seok KO
2013 Informatica  
In this article, we propose a practical algorithm for capacitated facility location problems (CFLP).  ...  However, MVCD has been previously applied only to uncapacitated facility location problems (UFLP), due to the fact that the performance is highly dependent on the structure of the problem.  ...  , for his generosity and kindness in letting the authors use his C code with detailed explanation in the computational experiments.  ... 
doi:10.15388/informatica.2013.02 fatcat:3m623acbrrcerixpeib2vmbvre

Optimal Capacities in Discrete Facility Location Design Problem

Ali Shahandeh Nookabadi, Mohammad Reza Yadoolahpour, Soheila Kavosh
2013 International Journal of Industrial Engineering and Production Research  
If the links network is unchangeably determined, the problem will be an FLP (Facility Location Problem).  ...  In a network location problem, nodes represent demand points and candidate locations to locate the facilities.  ...  A hybrid algorithm which combines Lagrangian heuristic and Ant colony System (ACS) to solve the single source capacitated facility location problem was proposed ant tested by Chen and Ting [13] .  ... 
doaj:0fd06f4ecd1b4bfa91362ea24c4417a6 fatcat:rrdcpwxsrnhfpoyokaadqv74ru

Parallel Metaheuristics Applications [chapter]

Teodor Gabriel Crainic, Nourredine Hail
2005 Parallel Metaheuristics  
1 2 PARALLEL META-HEURISTICS APPLICATIONS problems, set covering and partitioning, satisfiability and max-sat problems, quadratic assignment, location and network design, traveling salesman and vehicle  ...  The reader may consult a number of surveys, taxonomies, and syntheses of parallel meta-heuristics, of which quite a few address the "classical" meta-heuristics, Simulated Annealing, Genetic Algorithms,  ...  Acknowledgments Funding for this project has been provided by the Natural Sciences and Engineering Council of Canada, and by the Fonds FQRNT of the Province of Québec.  ... 
doi:10.1002/0471739383.ch19 fatcat:junbparoinckhfulturvyqvuxu

Efficient metaheuristics to solve the intermodal terminal location problem

Kenneth Sörensen, Christine Vanovermeire, Sylvie Busschaert
2012 Computers & Operations Research  
Determining the optimal number and location of intermodal transshipment terminals is a decision that strongly influences the viability of the intermodal transportation alternative.  ...  An argument in favor of the ABHC approach is that it is parameter-free and hence more transparent and likely to be accepted in a business or policy environment. 20  ...  The capacitated (fixed charge) facility location problem (CF-CLP), for which metaheuristics are frequently used as a solution method, shows some similarities.  ... 
doi:10.1016/j.cor.2011.10.005 fatcat:sff6randyvczvch3duoue7siki
« Previous Showing results 1 — 15 out of 593 results