Designing a new location-allocation and routing model with simultaneous pick-up and delivery in a closed-loop supply chain network under uncertainty

M Bathaee, H Nozari, A Szmelter-Jarosz - Logistics, 2023 - mdpi.com
Background: In this paper, a new closed-loop supply chain (CLSC) network model, including
economic, social and environmental goals, is designed. This paper's primary purpose is to …

Mathematical modeling of vehicle routing problem in omni-channel retailing

P Liu, A Hendalianpour, M Feylizadeh… - Applied Soft Computing, 2022 - Elsevier
The biggest challenge that retailers face in satisfying consumer requirements is to ensure an
integrated/seamless shopping experience consistent with the purchase, regardless of how …

Problem solving in crowd management using heuristic approach

AM Al-Shaery, MO Khozium, NS Farooqi… - IEEE …, 2022 - ieeexplore.ieee.org
There are many problems that procedural algorithms can solve efficiently. However, these
algorithms are sometimes too slow to abide by the time available for performing the solution; …

[PDF][PDF] A hybrid code genetic algorithm for VRP in public-private emergency collaborations

SR Wang, Q Huang - Int. J. Simul. Model, 2022 - ijsimm.com
To minimize the total time for the distribution of relief commodities participated by both
private companies and the government, a vehicle routing problem (VRP) model in …

Optimizing omnichannel retailer inventory replenishment using vehicle capacity-sharing with demand uncertainties and service level requirements

R Qiu, M Yuan, M Sun, ZP Fan, H Xu - European Journal of Operational …, 2025 - Elsevier
This study explores an inventory replenishment problem for an omnichannel retailer selling
a product with demand uncertainties and service level requirements in different channels …

Decision-Making Support in Vehicle Routing Problems: A Review of Recent Literature

SZ Abidin, NIZ Abidin, H Daud - Journal of Advanced …, 2025 - semarakilmu.com.my
Abstract The Vehicle Routing Problem (VRP) involves a set of customers with known
locations, each having a certain demand for goods or services. There is also a fleet of …

A simheuristic algorithm for solving the stochastic omnichannel vehicle routing problem with pick-up and delivery

LC Martins, C Bayliss, PJ Copado-Méndez, J Panadero… - Algorithms, 2020 - mdpi.com
Advances in information and communication technologies have made possible the
emergence of new shopping channels. The so-called 'omnichannel'retailing mode allows …

A Repetitive Grouping Max-Min Ant System for Multi-Depot Vehicle Routing Problem with Time Window

W Chen, R Liu, Q Guo, M Niu - International Conference on Swarm …, 2023 - Springer
The vehicle routing problem is a classic NP-hard problem in modern logistics industry. The
aim of this paper is to propose a repetitive grouping Max-Min Ant System (MMAS) to solve …

Applications of biased-randomized algorithms and simheuristics in integrated logistics

L Do Carmo Martins - 2021 - openaccess.uoc.edu
Transportation and logistics (T&L) activities play a vital role in the development of many
businesses from different industries. With the increasing number of people living in urban …

[PDF][PDF] Multi-product, Multi-supplier Order Assignment and Routing for an e-Commerce Application in the Retail Sector.

L Rivière, C Artigues, A Cheref, N Jozefowiez… - ICORES, 2021 - academia.edu
With the rise of virtualization, the share of e-commerce in the retail market continues to grow
in an omnichannel context. We consider an existing software tool, developed by the …