Solving a bi-objective transportation location routing problem by metaheuristic algorithms
From MaRDI portal
Publication:2256166
DOI10.1016/J.EJOR.2013.09.008zbMATH Open1305.90067OpenAlexW2025859861MaRDI QIDQ2256166FDOQ2256166
Rafael Caballero, T. Gómez, Julian Molina, Iris Martínez-Salazar, Francisco Angel-Bello
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.008
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization
- Integer Programming Formulation of Traveling Salesman Problems
- The effect of ignoring routes when locating depots
- Combined location-routing problems: A synthesis and future research directions
- Heuristic solutions to multi-depot location-routing problems
- Distribution network design: New problems and related models
- A compact model and tight bounds for a combined location-routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- The vehicle routing problem
- Location-routing: issues, models and methods
- Using clustering analysis in a capacitated location-routing problem
- A two-phase tabu search approach to the location routing problem
- A particle swarm optimization algorithm with path relinking for the location routing problem
- On the Complexity of Some Common Geometric Location Problems
- A multi-objective mathematical model for the industrial hazardous waste location-routing problem
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Variable neighborhood search for location routing
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Integrated supply chain design models: a survey and future research directions
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Cited In (18)
- Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation
- A flexible robust model for blood supply chain network design problem
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- The latency location-routing problem
- A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach
- Planning a capacitated road network with flexible travel times: a genetic algorithm
- A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables
- Location‐routing problem: a classification of recent research
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare
- Solving the multi‐objective bike routing problem by meta‐heuristic algorithms
- Bio-inspired meta-heuristics for emergency transportation problems
- Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics
- A survey of variants and extensions of the location-routing problem
Uses Software
This page was built for publication: Solving a bi-objective transportation location routing problem by metaheuristic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256166)
