Skip to Content
You are currently on the new version of our website. Access the old version .
MathematicsMathematics
  • Article
  • Open Access

22 November 2024

18 Pages

An Efficient Simulated Annealing Algorithm for the Vehicle Routing Problem in Omnichannel Distribution

,
,
,
and
1
Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan
2
Department of Information Management, Chang Gung University, Taoyuan 333, Taiwan
3
Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 204, Taiwan
4
Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei 243, Taiwan
This article belongs to the Section E2: Control Theory and Mechanics

Abstract

A variant of the vehicle routing problem (VRP) known as the Vehicle Routing Problem in Omnichannel Retailing Distribution Systems (VRPO) has recently been introduced in the literature, driven by the increasing adoption of omnichannel logistics in practice. The VRPO scenario involves a large retailer managing several stores, a depot, and a homogenous fleet of vehicles to meet the demands of both stores and online customers. This variant falls within the class of VRPs that consider precedence constraints. Although the vehicle routing problem in omnichannel retailing distribution (VRPO) has been addressed using a few heuristic and metaheuristic approaches, the use of Simulated Annealing (SA) remains largely unexplored in the pickup and delivery problem (PDP) literature, both before and after the rise of omnichannel logistics. This article introduces the Efficient Simulated Annealing (ESA) algorithm, demonstrating its suitability in generating new benchmark solutions for the VRPO. In experiments with sixty large instances, ESA significantly outperformed two previous algorithms, discovering new best-known solutions (BKSs) in fifty-nine out of sixty cases. Additionally, ESA demonstrated superior efficiency in 68.3% of the test cases in terms of reduced computational times, showcasing its higher effectiveness in handling complex VRPO instances.

1. Introduction

The progress in omnichannel operations gives rise to increasingly complex last-mile distribution networks over which customer information flows quickly and timely access is critical for effective customer response. As the last mile represents the most costly segment of the supply chain, achieving a cost-efficient vehicle routing continues to be a significant challenge. One of the most-studied Vehicle Routing Problem (VRP) variants arising from omnichannel applications is the Pickup and Delivery Problem (PDP). The PDP uses a set of vehicles to fulfill transportation requests consisting of a pickup location and a delivery location with a precedence constraint. Lokin [1] initially explored PDP, introducing a modified version of the traveling salesman problem. Precedence relations are imposed on specific customers, requiring certain nodes to be visited before others. The PDP consists of three main types of problems based on the origin–destination of each request, namely, many-to-many problems (type 1), one-to-many-to-one problems (type 2), and one-to-one problems (type 3) [2]. In type 1 PDP, requests are carried from more than one start node to more than one end node. In type 2 PDP, some requests start at the depot and end at many customers, while others start at a customer and end at the depot. In type 3 PDPs, each request moves from a single start node to a single end node.
In this work, we build on the capacitated Vehicle Routing Problem in Omnichannel Retailing Distribution Systems (VRPO), which was first introduced by Abdulkader et al. [3]. The VRPO is a VRP hybrid with CVRP and PDP features. It is an instance of omnichannel distribution, which is a business model that seeks to offer customers a seamless experience that involves both physical and online stores. The VRPO has two types of requests: (i) requests for store pickup and/or delivery and (ii) requests for customer delivery. Customer requests are made through online order points. A VRPO route follows the depot–store–customer precedence. This means that once a vehicle departs from the depot, it should pick up all store requests assigned to it before visiting the first store (delivery). Furthermore, the same vehicle should load (pickup) from the same store all the customer requests assigned to it before visiting those customers (delivery).
The VRPO inherits the NP-hard complexity of the VRP, resulting in prohibitively high computational time to reach an optimal solution. As exact methods struggle with scalability, heuristic approaches become a practical alternative. However, despite advances in heuristic approaches, a gap exists in the application of Simulated Annealing within the omnichannel VRP context. The reviewed studies predominantly rely on genetic algorithms, savings heuristics, and hybrid approaches, leaving SA underexplored. This gap highlights the potential for future research to utilize SA, leveraging its strengths in navigating complex solution landscapes and escaping local optima, to address the challenges presented by omnichannel logistics. Given the growing attention to the challenges of omnichannel VRPs and the clear literature gap in exploring simulated annealing (SA) for PDP, this work focuses on tailoring an SA-based metaheuristic approach, the Efficient Simulated Annealing (ESA) for the VRPO.
The remainder of this paper is organized as follows: Section 2 discusses the related works. Section 3 details the ESA for the VRPO. Section 4 presents the computational experiment and analysis. Finally, Section 5 discusses the conclusions and recommendations for future studies.

3. Solution Approach

This paper presents an efficient SA-based algorithm that employs a method to predetermine the ranking of parameters, namely, T0, Niter, beta, Nnimp, and UnitP. The first three are standard in classical SA, while the last two are efficiency parameters. The T0, Niter, and beta control the temperature cooling, while Nnimp and UnitP manage solution acceptance and stopping policy. Nimp, the “non-improving solution” parameter, terminates the outer loop if no improvement is found after a set number of iterations. UnitP is used in the penalty method to speed up the search by avoiding redundant objective function evaluations. The components of our ESA are detailed in the next sections.

3.1. Solution Encoding

The VRPO solution array includes c customers {C1, C2, …, CC}, r stores {R1, R2, …, Rr}, and n dummy zeros representing the start and end of routes. In Figure 1a–c, a sample solution is shown as a single array with one dummy zero, three stores, and eighteen customers, where dummy zeros act as route separators. The array is decoded into two routes. Route 1 starts at the depot, visits store R2 for stock replenishment and to pick up customer requests, delivers to customers C11, C10, C18, C12, C17, C6, C9, and C5, and returns to the depot. Route 2 visits R3 for customer pickups, delivers to customers C1 and C3, replenishes stock at store R1, picks up customer requests, delivers to customers C2, C15, C16, C13, C7, C4, C14, and C8, and returns to the depot.
Figure 1. VRPO solution representation: (a) array representation of a sample solution; (b) vehicle route representation; (c) graphical representation.
Each element of the solution array is decoded from left to right to form the routes. There are three cases for handling dummy zeros, as follows:
Case 1: If the next element after a dummy zero is another dummy zero, it is ignored, and the process continues.
Case 2: If the next element is a local store, the current vehicle terminates its route and returns to the warehouse, a new vehicle is activated, and decoding proceeds.
Case 3: If the next element is a customer, it is ignored, and decoding continues.
After decoding, travel time and vehicle load are evaluated, ensuring store and customer demands are met. If not, a penalty is applied based on the degree of violation, including for exceeding the maximum tour length.

3.2. Initialization

The initial solution is constructed using a simple rule to form a complete solution array; one vehicle is activated per local store. After visiting a store, the vehicle serves the closest unvisited customer. Algorithm 1 illustrates the detailed initialization procedure.
Algorithm 1: ESA Initialization for the VRPO
Function: Initialize to obtain an initial solution;
 Do
 A vehicle departs from the depot;
 A vehicle travels to the closest unused local store;
 Update: (1) vehicle’s current location, (2) vehicle load;
 Do
  Find the closest unserved customer which satisfies the following conditions:
  (1) The current vehicle can provide enough goods for this customer;
  (2) If this customer is served and the current vehicle
   goes back to the warehouse, it will not violate the max time of the vehicle;
   If  (one customer is found) {
     The current vehicle goes to serve this customer; and
     Update current vehicle location and the amount of goods in the vehicle;
     Update the partial solution;
     }
  } Until no unserved customer can be added to the current vehicle route;
   The current vehicle goes back to the depot;
   Update the partial solution;
   } Until all local stores are used

3.3. Neighborhood Operators: Swap, Insert, and Invert

To explore neighborhood solutions, the current solution S is perturbed using three neighborhood moves: insert, swap, and invert. A new solution S’, is generated at each iteration by applying one of these moves. The Insert move selects a random element of S and places it before another random position. The Swap move selects two random elements in S and swaps them. The Invert move selects a random subsequence of S and reverses its order. The probabilities for choosing each move are set equally.

3.4. Efficient Simulated Annealing (ESA) Algorithm

Algorithm 2 outlines the ESA algorithm. T0 is the initial temperature, Niter is the number of iterations at each temperature, and Nnimp is the maximum number of consecutive iterations without improvement. This parameter represents the maximum number of temperature reductions without finding a better solution. UnitP is the penalty applied for constraint violations, and beta is the cooling schedule coefficient. The algorithm proceeds as described.
The current temperature (T) is set to the initial temperature (T0), and the best solution (Sbest) is initialized as the current solution (S). The best objective function value (OFVbest) is set as OF(Sbest, UnitP), where OF is the objective function. A penalty, which is calculated as the unit penalty times the degree of the constraint violation, is applied when (1) the store product quantity is insufficient for the route, (2) the vehicle load exceeds capacity, or (3) the tour length exceeds the limit.
The search goes through a neighborhood search mechanism for each iteration at a given temperature. Selection probabilities, set uniformly at one-third for each of the three move operators, determine the move. Let delta be the difference between the new solution (S′) and the current solution (S), that is, delta = OF(S′, UnitP)-OF(S, UnitP). If delta <= 0, S′ replaces S; otherwise, S′ is accepted at a specific probability lambda between 0 and 1. If lambda is less than or equal to e−delta/T, S′ replaces S. The current temperature drops to T (beta), where 0 < beta < 1 after Niter iterations at the current temperature. The search terminates when the best solution has not improved after Nnimp consecutive temperature reductions. Also, the best solution (Sbest) and its objective function value (OFVbest) are updated when a better feasible solution is found. When the algorithm terminates, Sbest and OFVbest are returned.
Algorithm 2: ESA for the VRPO
Function: ESA-VRPO to find the best solution, Sbest;
Inputs: T0, Niter, Nnimp, UnitP, beta, and “problem instances”;
begin
Generate initial solution, S ← Initialize;
T ←T0, Sbest←S, Ncount←0, OFVbest← OF(S, UnitP);
While (nimp < Nnimp) do
 For iter = 1 to Niter do
 Generate prob = uniform (0,1);
 If (prob <= ⅓) ←Swap;
 If (⅓ < prob <= ⅔) ← Insert;
 If (⅔ < prob <= 1) ←Invert;
 delta = OF(S′, UnitP)-OF(S, UnitP);
 If (delta <= 0) then
  S ←S′;
 else
  Generate lambda = uniform (0,1);
  If (lambda <= e(-delta/T)) then
    S ←S′;
  endif
 endif
 If (S′ is feasible and OF(S′, UnitP) <= OFVbest) then
  Sbest←S′, OFVbest = OF(S′, UnitP), nimp ← 0;
 endif
endfor
   nimp = nimp +1; T ←T(beta);
endwhile
return Sbest, OFVbest;
end

4. Experiment

4.1. Test Instances

The small and large VRPO instance sets, which were used as benchmarks for this study, were obtained from Abdulkader et al. [3] as benchmarks for the comparative study. For details on data generation, readers may refer to their work. The small set includes 20 instances with 3, 4, 5, or 6 retail stores and 6, 9, 12, 15, or 18 consumers. The large set contains 60 instances with 10, 15, 20, or 25 stores and 25, 50, 75, 100, or 150 consumers, across three inventory cases (see Table 2). Instance data include the depot, stores, consumers, store products, stock levels, x-y coordinates, and pickup/delivery requests.
Table 2. Inventory availability cases.

4.2. Parameter Setting and Fine-Tuning

The algorithm-related parameters are listed and defined in Table 3, where L is the length of the solution array. With the five factors at four levels each, a total of 1024 experiments should be conducted. Alternatively, a representative sampling was conducted using Type B of the Taguchi L16 (45) orthogonal experimental design. A total of sixteen experimental combinations were used and compared. For each combination, ESA is implemented ten times independently per random instance of six instances.
Table 3. ESA parameter levels.
The performance of each combination is measured using the average relative percentage deviation (%Gap) and average computational time from 10 independent runs per combination. Table 4 and Table 5 present the results. Table 4 shows the average %Gap and computational times obtained from the predetermined parameter levels. The results highlight combinations 4 and 13 on Niter’s effect on the %Gap. The former has the least average %Gap (i.e., the least deviation with respect to the best solution found) at the highest Niter, while the latter has the highest average %Gap at the least Niter.
Table 4. CPU times and %Gaps of predetermined parameter levels.
Table 5. Rankings of parameters based on %Gap.
Table 5 shows the rankings of parameters based on percentage gaps. It reveals Niter as the most critical parameter with the largest average %Gap range. Parameters beta and T0 are the second and third in the ranking, respectively. It is hard to separate the influence of beta and T0 when determining the current T in the algorithm. T affects the probability of accepting worse solutions. Generally, a worse solution is frequently accepted at a higher T (i.e., the earlier search stage). As a result, the convergence at this stage is unlikely. As T decreases (i.e., the later search stage), worse solutions are often rejected, and the search gravitates locally. Lesser beta values cause drastic drops of current T and often cause the search process to become prematurely stuck in local optima. Nnimp helps in termination and convergence. Higher values of Nnimp may lead to more and unnecessary evaluations during the search. UnitP is considered a trivial parameter, as the search is most likely to reject an infeasible solution, let alone one with a high UnitP. Finally, to balance solution quality and computation time, the algorithm’s T0, Niter, beta, Nnimp, and UnitP parameter values were set to 30, 3500L, 0.96, 50, and 1500, respectively.

4.3. Results and Discussion

This section presents the results of ESA’s performance compared to the baseline algorithms 2PH and MAC. The experiment was implemented on a server with four 2.1 GHz processors with 16 cores each and 256 GB RAM. Our implementation used Microsoft Visual C++ 2019 on a desktop with an Intel Core i9-10900 CPU @ 2.80GHz, 64 GB of RAM, and Windows 11.

4.3.1. Small Instances

In small problems, the results as shown in Table 6 suggest that our ESA is at par in terms of solution quality and average solution quality but generally superior in terms of computational time. ESA consistently obtains the optimal solution for all twenty small instances, as demonstrated in the ESA (Best) and %Gap (Best) columns of Table 6, matching the optimal solution provided by the exact solver. While our results are clearly better than those of 2PH, there are slight differences in the five instances in which our results are compared to MAC. Finally, ESA outperforms MAC in three instances a8, a15, and a20. However, ESA is outperformed by MAC in two instances: a5 and a10.
Table 6. Comparison of ESA to 2PH, and MAC in small instances.

4.3.2. Large Instances

The large instances feature up to 25 local stores and 150 customers. To further evaluate these instances, three inventory scenarios are considered. Table 7a–c show the results for instances b1–b20 under low inventory, b21–b40 under moderate inventory, and b41–b60 under high inventory.
1.
Best Know Solutions (BKS): The ESA found fifty-nine new BKS out of sixty large problem instances compared to the 2PH and MAC results. However, for instance b31, MAC’s result remains the BKS (refer to the BKS column).
2.
Performance Comparison Based on BKS: Using the BKS, we calculated the percentage gaps for 2PH and MAC, which are shown in the %Gap (2PH) and %Gap (MAC) columns. Table 7d summarizes the performance improvements of ESA over 2PH and MAC.
  • For the ESA-Best results, ESA outperformed 2PH by 78.033%, 80.934%, and 41.853% in low, moderate, and high inventory cases, respectively. For the ESA-Ave results, ESA outperformed 2PH by 75.124%, 77.683%, and 4.941% in the respective cases.
  • Against MAC, ESA outperformed with ESA-Best results by 10.185%, 10.478%, and 4.990% for low, moderate, and high inventory cases, respectively. For the ESA-Ave results, ESA outperformed MAC by 7.275%, 7.218%, and 4.077% for each corresponding scenario.
3.
Stability and Robustness Analysis: To assess the stability and robustness of ESA, we calculated the percentage deviation between the average fitness values (ESA-Ave) and the best solution found (ESA-Best). High-inventory cases exhibited the smallest deviation at 0.913%, indicating strong stability. Deviations for low and moderate cases are 2.909% and 3.275%, respectively, reflecting consistent performance across inventory levels. Figure 2a–c illustrate the percentage gaps of ESA compared to MAC across instances per scenario, showing that ESA consistently maintains greater stability around the average gaps. Additionally, the gaps decrease as the scenarios become more challenging, demonstrating ESA’s robustness.
4.
Average Computational Time: ESA outperformed MAC in 68.33% of the sixty cases. Specifically, ESA demonstrated shorter computation times in 50% of the low inventory cases, 70% of the moderate inventory cases, and 85% of the high inventory cases. As instance difficulty increases ESA’s performance becomes better. Figure 3 compares the computational times of MAC and ESA across three cases. While MAC’s computational time increased significantly with harder instances, ESA maintained a stable trend, demonstrating consistent efficiency and highlighting its scalability and effectiveness.
In summary, ESA significantly outperformed 2PH and MAC, establishing new BKS for fifty-nine out of sixty cases. The low percentage deviations in solution quality highlight its robustness and stability, particularly in high inventory cases. Moreover, the ESA algorithm not only delivers superior solutions but also excels in computational efficiency, especially for harder cases.
Table 7. (a) SA vs. 2PH and MAC algorithms in large instances in low-inventory scenarios. (b) ESA vs. 2PH and MAC in large instances in moderate-inventory scenarios. (c) SA vs. 2PH and MAC in large instances in high-inventory scenarios. (d) Summary of ESA performance w.r.t. 2PH and MAC.
Figure 2. Average %Gap with respect to BKS across inventory cases: MAC vs. ESA. (a) Low; (b) Moderate; and (c) High.
Figure 3. CPU time (sec) across 60 cases of MAC vs. ESA.

5. Summary and Conclusions

The VRPO is a hybrid VRP with PDP and SPDP features. As omnichannel operations evolve, last-mile distribution networks are becoming increasingly complex, making the pickup and delivery problems relevant than ever. To solve the VRPO, we tailor an efficient SA-based algorithm with two efficiency features: the non-improving solution parameter (Nnimp) and the unit penalty function (UnitP) for constraint handling. The experimental study demonstrated ESA’s performance in terms of solution quality, average quality, robustness, and efficiency.
Building on the study of Abdulkader et al. [3], the experiment revealed the following results: (i) ESA obtained optimal solutions for all twenty small instances, (ii) ESA established fifty-nine new BKSs out of sixty large instances, (iii) ESA outperformed the MAC algorithm by 6.190% in terms of solution quality, (iv) ESA was faster than MAC in 68.3% of the sixty cases, and (v) ESA demonstrated a better robustness than MAC, as evidenced by the stable and consistent trend of computational times across all sixty instances.
The PDP domains in the omnichannel context offer a promising opportunity to test and demonstrate various solution approaches, including exact methods, heuristics, metaheuristics, and hybrids. This study addresses the gap regarding the underexplored use of SA-based algorithms for PDPs in pre- or post-omnichannel settings. As a flexible framework, it is recommended for further exploration of other SA components. Testing VRPO instances with neighborhood-based metaheuristics like variable neighborhood search (VNS), large neighborhood search (LNS), and variable neighborhood descent (VND), which have gained traction recently, would be valuable. Additionally, applying the framework to new omnichannel distribution network variants—such as managing customer returns, delivering goods to secondary markets or recycling, and warehouse milk-run deliveries—offers further opportunities to extend the VRPO.
The landscape of metaheuristics for solving vehicle routing problems has significantly evolved, with recent advancements particularly emphasizing hybrid and AI-driven approaches. For instance, a hybrid simulated annealing and variable neighborhood search algorithm was developed for a novel variant of electric vehicle routing (EVRP) called close–open EVRP (COEVRP) [36]. The use of such hybrid approaches has been instrumental in achieving high-quality solutions, especially in complex VRP variants. Furthermore, the integration of adaptive algorithms [37] and reinforcement learning [30] into the simulated annealing algorithm offers a better position for it to advance further.

Author Contributions

Conceptualization, V.F.Y. and C.-H.L.; Methodology, V.F.Y., R.S.M. and S.-W.L.; Validation, C.-H.L., R.S.M. and S.-W.L.; Formal analysis, C.-H.L., S.-W.L. and K.-F.C.; Investigation, V.F.Y. and S.-W.L.; Data curation, C.-H.L., S.-W.L. and K.-F.C.; Writing—original draft, C.-H.L. and R.S.M.; Writing—review & editing, V.F.Y., S.-W.L. and K.-F.C.; Visualization, C.-H.L. and R.S.M.; Supervision, V.F.Y. and S.-W.L.; Project administration, V.F.Y.; Funding acquisition, V.F.Y. and S.-W.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially supported by the National Science and Technology Council, the Republic of China (Taiwan) under Grant MOST111-2410-H-011-020-MY3 for the first author, and was partially supported by the National Science and Technology Council, Republic of China (Taiwan) under Grant NSTC112-2410-H-182-002-MY3 for the corresponding author.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the authors on request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lokin, F.C.J. Procedures for Travelling Salesman Problems with Additional Constraints. Eur. J. Oper. Res. 1979, 3, 135–141. [Google Scholar] [CrossRef] [Scilit]
  2. Berbeglia, G.; Cordeau, J.-F.; Gribkovskaia, I.; Laporte, G. Static Pickup and Delivery Problems: A Classification Scheme and Survey. TOP 2007, 15, 1–31. [Google Scholar] [CrossRef] [Scilit]
  3. Abdulkader, M.M.S.; Gajpal, Y.; ElMekkawy, T.Y. Vehicle Routing Problem in Omni-Channel Retailing Distribution Systems. Int. J. Prod. Econ. 2018, 196, 43–55. [Google Scholar] [CrossRef] [Scilit]
  4. Braekers, K.; Caris, A.; Janssens, G.K. Exact and Meta-Heuristic Approach for a General Heterogeneous Dial-a-Ride Problem with Multiple Depots. Transp. Res. Part B Methodol. 2014, 67, 166–186. [Google Scholar] [CrossRef] [Scilit]
  5. Parragh, S.N.; Doerner, K.F.; Hartl, R.F. A Survey on Pickup and Delivery Problems. Part I: Transportation Between Customers and Depot. J. Für Betriebswirtschaft 2008, 58, 21–51. [Google Scholar] [CrossRef] [Scilit]
  6. Battarra, M.; Cordeau, J.-F.; Iori, M. Chapter 6: Pickup-and-Delivery Problems for Goods Transportation. In Vehicle Routing: Problems, Methods, and Applications; MOS-SIAM Series on Optimization; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 2014; pp. 161–191. [Google Scholar]
  7. Parragh, S.N.; Doerner, K.F.; Hartl, R.F. A Survey on Pickup and Delivery Problems: Part II: Transportation Between Pickup and Delivery Locations. J. Für Betriebswirtschaft 2008, 58, 81–117. [Google Scholar] [CrossRef] [Scilit]
  8. Beck, N.; Rygl, D. Categorization of Multiple Channel Retailing in Multi-, Cross-, and Omni-Channel Retailing for Retailers and Retailing. J. Retail. Consum. Serv. 2015, 27, 170–178. [Google Scholar] [CrossRef] [Scilit]
  9. Martins, L.D.C.; Bayliss, C.; Juan, A.A.; Panadero, J.; Marmol, M. A Savings-Based Heuristic for Solving the Omnichannel Vehicle Routing Problem with Pick-up and Delivery. Transp. Res. Procedia 2020, 47, 83–90. [Google Scholar] [CrossRef] [Scilit]
  10. Martins, L.D.C.; Bayliss, C.; Copado-Méndez, P.J.; Panadero, J.; Juan, A.A. A Simheuristic Algorithm for Solving the Stochastic Omnichannel Vehicle Routing Problem with Pick-up and Delivery. Algorithms 2020, 13, 237. [Google Scholar] [CrossRef] [Scilit]
  11. Bayliss, C.; Martins, L.d.C.; Juan, A.A. A Two-Phase Local Search with a Discrete-Event Heuristic for the Omnichannel Vehicle Routing Problem. Comput. Ind. Eng. 2020, 148, 106695. [Google Scholar] [CrossRef] [Scilit]
  12. Sawicki, P.; Sawicka, H. Optimisation of the Two-Tier Distribution System in Omni-Channel Environment. Energies 2021, 14, 7700. [Google Scholar] [CrossRef] [Scilit]
  13. Janjevic, M.; Merchán, D.; Winkenbach, M. Designing Multi-Tier, Multi-Service-Level, and Multi-Modal Last-Mile Distribution Networks for Omni-Channel Operations. Eur. J. Oper. Res. 2021, 294, 1059–1077. [Google Scholar] [CrossRef] [Scilit]
  14. Guerrero-Lorente, J.; Gabor, A.F.; Ponce-Cueto, E. Omnichannel Logistics Network Design with Integrated Customer Preference for Deliveries and Returns. Comput. Ind. Eng. 2020, 144, 106433. [Google Scholar] [CrossRef] [Scilit]
  15. Liu, P.; Hendalianpour, A.; Feylizadeh, M.; Pedrycz, W. Mathematical Modeling of Vehicle Routing Problem in Omni-Channel Retailing. Appl. Soft Comput. 2022, 131, 109791. [Google Scholar] [CrossRef] [Scilit]
  16. Hendalianpour, A.; Fakhrabadi, M.; Sangari, M.S.; Razmi, J. A Combined Benders Decomposition and Lagrangian Relaxation Algorithm for Optimizing a Multi-Product, Multi-Level Omni-Channel Distribution System. Sci. Iran. 2022, 29, 355–371. [Google Scholar] [CrossRef] [Scilit]
  17. Li, Y. A Selective Many-to-Many Pickup and Delivery Problem with Handling Cost in the Omni-Channel Last-Mile Delivery. IEEE Access 2022, 10, 111284–111296. [Google Scholar] [CrossRef] [Scilit]
  18. Yang, J.; Li, Y. A Multicommodity Pickup and Delivery Problem with Time Windows and Handling Time in the Omni-Channel Last-Mile Delivery. Int. Trans. Oper. Res. 2023. [Google Scholar] [CrossRef] [Scilit]
  19. Qiu, R.; Yuan, M.; Sun, M.; Fan, Z.P.; Xu, H. Optimizing Omnichannel Retailer Inventory Replenishment Using Vehicle Capacity-Sharing with Demand Uncertainties and Service Level Requirements. Eur. J. Oper. Res. 2025, 320, 417–432. [Google Scholar] [CrossRef] [Scilit]
  20. Li, N.; Wang, Z. Vehicle Routing Problem for Omnichannel Retailing Including Multiple Types of Time Windows and Products. Comput. Oper. Res. 2025, 173, 106828. [Google Scholar] [CrossRef] [Scilit]
  21. Wang, C.; Mu, D.; Zhao, F.; Sutherland, J.W. A Parallel Simulated Annealing Method for the Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows. Comput. Ind. Eng. 2015, 83, 111–122. [Google Scholar] [CrossRef] [Scilit]
  22. Avci, M.; Topaloglu, S. An Adaptive Local Search Algorithm for Vehicle Routing Problem with Simultaneous and Mixed Pickups and Deliveries. Comput. Ind. Eng. 2015, 83, 15–29. [Google Scholar] [CrossRef] [Scilit]
  23. Danloup, N.; Allaoui, H.; Goncalves, G. A Comparison of Two Meta-Heuristics for the Pickup and Delivery Problem with Transshipment. Comput. Oper. Res. 2018, 100, 155–171. [Google Scholar] [CrossRef] [Scilit]
  24. Koç, Ç.; Laporte, G.; Tükenmez, İ. A Review of Vehicle Routing with Simultaneous Pickup and Delivery. Comput. Oper. Res. 2020, 122, 104987. [Google Scholar] [CrossRef] [Scilit]
  25. Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P. Optimization by Simulated Annealing. Science 1983, 220, 671–680. [Google Scholar] [CrossRef] [Scilit]
  26. İlhan, İ. An Improved Simulated Annealing Algorithm with Crossover Operator for Capacitated Vehicle Routing Problem. Swarm Evol. Comput. 2021, 64, 100911. [Google Scholar] [CrossRef] [Scilit]
  27. Lin, S.W.; Cheng, C.Y.; Pourhejazy, P.; Ying, K.C. Multi-Temperature Simulated Annealing for Optimizing Mixed-Blocking Permutation Flowshop Scheduling Problems. Expert Syst. Appl. 2021, 165, 113837. [Google Scholar] [CrossRef] [Scilit]
  28. Yu, V.F.; Anh, P.T.; Gunawan, A.; Han, H. A Simulated Annealing with Variable Neighborhood Descent Approach for the Heterogeneous Fleet Vehicle Routing Problem with Multiple Forward/Reverse Cross-Docks. Expert Syst. Appl. 2024, 237, 121631. [Google Scholar] [CrossRef] [Scilit]
  29. Leite, N.; Melício, F.; Rosa, A.C. A Fast Simulated Annealing Algorithm for the Examination Timetabling Problem. Expert Syst. Appl. 2019, 122, 137–151. [Google Scholar] [CrossRef] [Scilit]
  30. Rodríguez-Esparza, E.; Masegosa, A.D.; Oliva, D.; Onieva, E. A New Hyper-Heuristic Based on Adaptive Simulated Annealing and Reinforcement Learning for the Capacitated Electric Vehicle Routing Problem. Expert Syst. Appl. 2024, 252, 124197. [Google Scholar] [CrossRef] [Scilit]
  31. Yu, V.F.; Indrakarna, P.A.Y.; Ngurah, A.A.; Redi, P.; Lin, S.-W. Simulated Annealing with Mutation Strategy for the Share-a-Ride Problem with Flexible Compartments. Mathematics 2021, 9, 2320. [Google Scholar] [CrossRef] [Scilit]
  32. Lin, S.W.; Yu, V.F. Solving the Team Orienteering Problem with Time Windows and Mandatory Visits by Multi-Start Simulated Annealing. Comput. Ind. Eng. 2017, 114, 195–205. [Google Scholar] [CrossRef] [Scilit]
  33. Ying, K.C.; Lin, S.W. Minimizing Total Completion Time in the No-Wait Jobshop Scheduling Problem Using a Backtracking Metaheuristic. Comput. Ind. Eng. 2022, 169, 108238. [Google Scholar] [CrossRef] [Scilit]
  34. Lin, S.W.; Cheng, C.Y.; Pourhejazy, P.; Ying, K.C.; Lee, C.H. New Benchmark Algorithm for Hybrid Flowshop Scheduling with Identical Machines. Expert Syst. Appl. 2021, 183, 115422. [Google Scholar] [CrossRef] [Scilit]
  35. Yu, V.F.; Susanto, H.; Yeh, Y.-H.; Lin, S.-W.; Huang, Y.-T. The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers. Mathematics 2022, 10, 920. [Google Scholar] [CrossRef] [Scilit]
  36. Stamadianos, T.; Kyriakakis, N.A.; Marinaki, M.; Marinakis, Y. A Hybrid Simulated Annealing and Variable Neighborhood Search Algorithm for the Close-Open Electric Vehicle Routing Problem. Ann. Math. Artif. Intell. 2023. [Google Scholar] [CrossRef] [Scilit]
  37. Xiao, S.; Peng, P.; Zheng, P.; Wu, Z. A Hybrid Adaptive Simulated Annealing and Tempering Algorithm for Solving the Half-Open Multi-Depot Vehicle Routing Problem. Mathematics 2024, 12, 947. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.