A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach

DOI10.1007/s10852-015-9274-3zbMath1330.90009OpenAlexW2052166399MaRDI QIDQ894544

Kaveh Khalili-Damghani, Amir Ghasemi, Amir-Reza Abtahi

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-015-9274-3

zbMATH Keywords

mixed-integer programmingmulti-objective genetic algorithmlocation-routing problembi-objective optimization\(\varepsilon\)-constraint methoddistribution of perishable products

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (2)

Location‐routing problem: a classification of recent research ⋮ A robust simulation-optimization approach for pre-disaster multi-period location-allocation-inventory planning

Cites Work

• Unnamed Item
• A survey of recent research on location-routing problems
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• Battery swap station location-routing problem with capacitated electric vehicles
• A bi-objective model for the used oil location-routing problem
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
• A hybrid evolutionary algorithm for the periodic location-routing problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
• A new model for the hazardous waste location-routing problem
• Location-routing: issues, models and methods
• Using clustering analysis in a capacitated location-routing problem
• Multiobjective optimization. Interactive and evolutionary approaches
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• The effect of ignoring routes when locating depots
• An integrated multi-objective framework for solving multi-period project selection problems
• A multi-objective mathematical model for the industrial hazardous waste location-routing problem
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
• A survey of variants and extensions of the location-routing problem
• The Truck Dispatching Problem

This page was built for publication: A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach