Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review

RD Tordecilla, AA Juan, JR Montoya-Torres… - … modelling practice and …, 2021 - Elsevier
The design of supply chain networks (SCNs) aims at determining the number, location, and
capacity of production facilities, as well as the allocation of markets (customers) and …

Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

L Calvet, J De Armas, D Masip, AA Juan - Open Mathematics, 2017 - degruyter.com
This paper reviews the existing literature on the combination of metaheuristics with machine
learning methods and then introduces the concept of learnheuristics, a novel type of hybrid …

Analytics and machine learning in vehicle routing research

R Bai, X Chen, ZL Chen, T Cui, S Gong… - … Journal of Production …, 2023 - Taylor & Francis
The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial
optimisation problems for which numerous models and algorithms have been proposed. To …

A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints

Y Wang, Y Wei, X Wang, Z Wang, H Wang - Applied Soft Computing, 2023 - Elsevier
Since the multidepot vehicle routing problem with time windows and three-dimensional
loading constraints (MDVRPTW-TDLC) is a multiconstraint and combinatorial optimization …

Emergency logistics network optimization with time window assignment

Y Wang, X Wang, J Fan, Z Wang, L Zhen - Expert systems with applications, 2023 - Elsevier
During natural disasters or accidents, an emergency logistics network aims to ensure the
distribution of relief supplies to victims in time and efficiently. When the coronavirus disease …

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems

MEH Sadati, B Çatay, D Aksen - Computers & Operations Research, 2021 - Elsevier
Abstract We present a Variable Tabu Neighborhood Search (VTNS) algorithm for solving a
class of Multi-Depot Vehicle Routing Problems (MDVRP). The proposed algorithm applies a …

Collaborative two-echelon multicenter vehicle routing optimization based on state–space–time network representation

Y Wang, Y Yuan, X Guan, M Xu, L Wang… - Journal of Cleaner …, 2020 - Elsevier
Collaboration among service providers in a logistics network can greatly increase their
operation efficiencies and reduce transportation emissions. This study proposes, formulates …

Two-echelon location-routing optimization with time windows based on customer clustering

Y Wang, K Assogba, Y Liu, X Ma, M Xu… - Expert Systems with …, 2018 - Elsevier
This paper develops a three-step customer clustering based approach to solve two-echelon
location routing problems with time windows. A bi-objective model minimizing costs and …

Multi-depot vehicle routing problem for hazardous materials transportation: A fuzzy bilevel programming

J Du, X Li, L Yu, R Dan, J Zhou - Information sciences, 2017 - Elsevier
Due to enormous demand and potential threat to public, hazardous materials transportation
has been tremendously investigated in recent years. However, there are few studies …

A review of the role of heuristics in stochastic optimisation: From metaheuristics to learnheuristics

AA Juan, P Keenan, R Martí, S McGarraghy… - Annals of Operations …, 2023 - Springer
In the context of simulation-based optimisation, this paper reviews recent work related to the
role of metaheuristics, matheuristics (combinations of exact optimisation methods with …