Next Article in Journal
SynthSecureNet: An Improved Deep Learning Architecture with Application to Intelligent Violence Detection
Previous Article in Journal
SMOTE vs. SMOTEENN: A Study on the Performance of Resampling Algorithms for Addressing Class Imbalance in Regression Models
Previous Article in Special Issue
A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Survey on Variable Neighborhood Search for Sustainable Logistics

by
Jesica de Armas
1,* and
José A. Moreno-Pérez
2
1
Department of Economics and Business, Universitat Pompeu Fabra, 08005 Barcelona, Spain
2
Department of Computer and Systems Engineering, Universidad de La Laguna, 38200 La Laguna, Spain
*
Author to whom correspondence should be addressed.
Algorithms 2025, 18(1), 38; https://doi.org/10.3390/a18010038
Submission received: 13 December 2024 / Revised: 31 December 2024 / Accepted: 7 January 2025 / Published: 10 January 2025
(This article belongs to the Special Issue Heuristic Optimization Algorithms for Logistics)

Abstract

:
Sustainable logistics aims to balance economic efficiency, environmental responsibility, and social well-being in supply chain operations. This study explores the use of Variable Neighborhood Search (VNS), a metaheuristic optimization method, in addressing sustainable logistics challenges and provides insights into the potential it has to support them by delivering efficient solutions that align with global sustainability goals. The review identifies key trends, including a significant increase in research since 2019, with a strong focus on routing, scheduling, and location problems. Hybrid approaches, combining VNS with other methods, and multiobjective optimization to address trade-offs between sustainability goals are prominent. The most frequently applied VNS versions align closely with those commonly used in the broader literature, reflecting similar adoption proportions. In recent years, a noticeable increase in studies incorporating adaptation mechanisms into VNS frameworks has emerged. This trend is largely driven by the growing influence of Artificial Intelligence approaches across numerous fields of science and engineering, highlighting the need for more dynamic and intelligent optimization techniques. However, important research gaps remain. These include limited consideration of uncertainty and dynamic logistics systems, underrepresentation of social sustainability, and a lack of standardized benchmarks for comparing results. Future work should address these challenges and explore emerging applications.

Graphical Abstract

1. Introduction

Logistics plays a crucial role in modern economies by facilitating the movement and storage of goods, services, and information from their point of origin to their point of consumption, with the primary goal of satisfying customer or business requirements. It involves the strategic planning, implementation, and control of various interconnected activities, such as transportation, warehousing, inventory management, and coordination of supply chains. These functions are essential to ensuring timely delivery, optimizing resource utilization, maintaining cost efficiency, and improving overall service levels.
In recent years, the concept of sustainability has become increasingly integrated into logistics practices, driven by the need for businesses to meet the growing consumer demand for environmentally friendly products and services, as well as to comply with stricter environmental regulations worldwide. Sustainable logistics is a broader concept that refers to the management and optimization of supply chain processes in a way that minimizes environmental impact, promotes social responsibility, and ensures economic viability. The challenge lies in balancing these three pillars of sustainability—economic, environmental, and social—while maintaining high levels of service and efficiency. Sustainable logistics encompasses a range of initiatives aimed at reducing carbon emissions, implementing eco-friendly transportation methods, optimizing resource utilization, and minimizing waste, all while ensuring that businesses continue to thrive in an increasingly competitive market.
The goal of sustainable logistics is to create a harmonious balance between economic growth, environmental stewardship, and social well-being. It requires careful consideration of immediate and long-term impacts on the environment, society, and economy. By optimizing logistics processes through sustainable practices, businesses can not only reduce their ecological footprint but also contribute to broader global sustainability goals. In the context of this study, the three key dimensions of sustainability are defined as follows:
  • Economic sustainability refers to the ability of an economic system to support long-term growth while ensuring the efficient use of resources and financial stability. It requires careful management to avoid negative impacts on social, environmental, or cultural factors. It emphasizes the efficient allocation of resources to ensure that industries, businesses, and economies can continue to function in a sustainable manner, while also providing opportunities for future generations to prosper.
  • Environmental sustainability focuses on managing and conserving natural resources in a responsible manner to prevent ecosystem degradation and ensure that these resources remain available for future generations. This dimension of sustainability involves reducing pollution, conserving biodiversity, minimizing waste, and promoting renewable energy sources and sustainable practices in industries such as transportation, manufacturing, and agriculture. The ultimate objective is to protect the health of the planet and maintain its ecological balance for the well-being of future generations.
  • Social sustainability is about creating and maintaining societies that promote social equity, justice, and well-being for all individuals. This pillar focuses on ensuring access to basic services such as education, healthcare, and employment opportunities, as well as fostering inclusive and resilient communities. Social sustainability emphasizes the importance of respecting human rights, cultural diversity, and social progress, ensuring that future generations inherit a world characterized by equality, fairness, and peace.
These three pillars are deeply interconnected and often contradictory. For example, efforts to reduce environmental impacts might increase short-term costs, while focusing on social well-being may complicate economic efficiency. To address these complexities, a system’s approach is essential, one that acknowledges the dynamic interplay and trade-offs among these dimensions. In addition, sustainability is closely aligned with the principles of a circular economy, which seeks to minimize waste and optimize resource utilization across the entire value chain—from production to consumption. By closing the loop through strategies such as recycling, reuse, and remanufacturing, the circular economy supports the Sustainable Development Goals (SDGs) adopted by the United Nations [1,2]. These goals emphasize rational resource use, reduced environmental impact, and improved social well-being. Embedding such principles into sustainable logistics not only addresses immediate challenges but also creates long-term strategies for resilient and efficient systems.
Given the growing importance of sustainable logistics, optimization techniques like Variable Neighborhood Search (VNS) have gained attention in recent years due to their ability to solve complex, combinatorial optimization problems. VNS is a powerful metaheuristic framework widely used for solving large-scale global optimization problems across various domains, including logistics. It operates by systematically exploring different neighborhood structures to diversify the search and enhance intensification, making it highly effective in identifying high-quality solutions. VNS has shown particular promise in solving logistics-related problems, where finding optimal or near-optimal solutions is critical to improving efficiency, minimizing costs, and achieving sustainability goals.
The connection between VNS and sustainable logistics lies in its ability to address the three core dimensions of sustainability—economic, environmental, and social—through optimization techniques. VNS contributes to sustainable logistics by enabling decision-makers to optimize critical operations, such as minimizing carbon emissions in transportation, reducing energy consumption in warehouses, and improving resource allocation across supply chains. Moreover, its capacity to handle multiobjective problems, especially when it is hybridized with other optimization methods, ensures that economic efficiency can be balanced with environmental and social considerations, such as integrating renewable energy sources into logistics networks or improving worker welfare.
VNS can also guide the development of sustainable logistics goals by offering a structured approach to explore and evaluate potential trade-offs between conflicting objectives. For instance, it can prioritize solutions that reduce costs while maintaining low environmental impacts, thus supporting organizations in meeting sustainability targets. Additionally, the adaptability of VNS allows it to incorporate specific constraints and scenarios, such as uncertainty in demand or dynamic changes in logistics networks, making it a practical and versatile tool for achieving long-term sustainability goals.
The versatility and robustness of VNS make it an ideal tool for addressing the optimization challenges that arise in sustainable logistics, particularly those that involve complex decision-making, such as routing, scheduling, and location. By applying VNS to these logistics problems, it is possible to simultaneously consider economic, environmental, and social factors, providing solutions that balance efficiency with sustainability. Furthermore, VNS can be adapted and hybridized with other optimization methods to enhance its effectiveness in solving multiobjective problems, which is particularly relevant in sustainable logistics, where multiple conflicting objectives must be considered.
This study aims to investigate the use of VNS in sustainable logistics in a deeper way by addressing the following key research questions:
  • In which specific areas of sustainable logistics is VNS most commonly applied, and what types of problems does it address most effectively?
  • Which VNS variants are utilized most frequently to solve these sustainable logistics problems?
  • How is VNS commonly hybridized with other optimization methods to tackle complex logistics challenges, and which hybridization approaches have proven to be the most effective?
  • How are multiobjective logistics problems, which often involve trade-offs between different sustainability aspects, addressed when employing VNS?
  • Which aspects of sustainability are most frequently considered when applying VNS to solve logistics problems, and how are these aspects integrated into the optimization process?
By answering these questions, this study will contribute to the growing body of knowledge regarding the use of VNS in sustainable logistics, integrating economic, environmental, and social dimensions of sustainability. Unlike existing reviews that primarily focus on specific VNS variants or isolated applications, our work takes a holistic approach, identifying trends, challenges, and opportunities across multiple facets of sustainable logistics, such as routing, scheduling, and supply chain design. The findings will provide valuable insights into the application of VNS in various logistics challenges and how it can be leveraged to enhance sustainability in logistics operations. Additionally, we highlight the growing importance of adaptive and hybrid VNS methods in addressing the dynamic and multiobjective nature of logistics problems. By systematically categorizing and analyzing the literature, this study not only offers new insights into the current state of VNS research but also identifies critical gaps and provides actionable recommendations for future work.
The remainder of this article is structured as follows. Section 2 provides a detailed description of the VNS methodology, including its key versions and extensions. Section 3 outlines the review methodology used in this study, detailing the steps taken to identify the relevant literature and analyze the results. Section 4 presents the findings of the literature review, focusing on the main applications, hybridizations, and sustainability considerations associated with VNS in sustainable logistics. Section 5 presents a discussion highlighting the research trends, challenges, and gaps identified in the reviewed literature and offers directions for future research. Section 6 presents a discussion on advantages, limitations, and decisions when implementing VNS for sustainable logistics. Finally, Section 7 concludes the article with a summary of key insights and their implications for both research and practice in sustainable logistics optimization.

2. VNS: Concept, Versions, and Extensions

VNS is a metaheuristic proposed by Nenad Mladenović in 1995 [3], whose key idea was to apply systematic changes in the neighborhood structure during search. The metaheuristic framework was first formalized in 1997 in joint works with Pierre Hansen [4,5]. The principles of this metaheuristic were established in 2001 [6]. VNS has played an important role in the field of metaheuristics and its applications [7,8,9]. This metaheuristic and its versions have been applied to a large series of optimization problems and most logistic problems since the beginning of the century [9,10]. These versions appear considering variations of their components and the inclusion of another ingredient in the framework [11]. It has three main components: a shaking method, an improvement procedure, and a neighborhood change strategy [7]. The main versions are the Basic VNS (BVNS), the Reduced VNS (RVNS), the Variable Neighborhood Descent (VND), the General VNS (GVNS), and the Adaptive VNS (AVNS).
The BVNS proposal consists of using a series of neighborhood structures to shake the incumbent solution, a local search to improve it, and the sequential change strategy for the neighborhood structure. Each neighborhood structure is given by a specific set of moves that can be applied to a solution; the neighborhood of that solution is constituted by the solutions that can be obtained by applying one of these moves. The shaking of a solution consists of selecting a random solution from its neighborhood. The sequential strategy consists of selecting the next neighborhood structure of the series if there is no improvement in the best solution found so far and starting with the first structure of the series otherwise. Therefore, starting from the initial solution as the current solution, the procedure shakes and applies the local search to the current. The change strategy is applied until no improvement in the best solution is obtained with the last structure of the series.
RVNS is a very simple proposal that consists of excluding the improvement step in BVNS [7]. An RVNS method is obtained when no local search is applied after shaking the current solution, i.e., selecting the next neighborhood structure of the series if the shaking solution does not improve the best solution found so far and starting with the first structure of the series otherwise. VND is the variant that appears by applying the core VNS idea of a sequential change in the neighborhood structure to a neighborhood-based local search.
GVNS is one of the most widely used versions of VNS [7]. This variant is obtained from BVNS, using a VND as the improvement step. The series of neighborhoods used in the shaking phase and in the VND could be the same, but usually they are different because their purposes are different. Different versions of VNS appear by considering variations of these proposals and the inclusion of another ingredient in the framework [11].
As a result of the current tendency, the relevance of Artificial Intelligence (AI) approaches in science and technology has the effect of using adaptive tools in optimization search [8]. AVNS is the result of the incorporation of an adaptive mechanism into some of the components of a VNS, mainly in the way of ordering the neighborhoods or when they are selected. The first explicit proposals of an AVNS are in [12,13]. From the BNS, the AVNS obtained consists of using an adaptive mechanism in the shaking phase by favoring moves or neighborhoods according to their success within the search. This approach is used in sustainable logistics in [14,15,16,17,18]. A second way is to select the neighborhood for the improvement procedure, usually in a VND, based on its performance during the search process that is applied to sustainable logistics in [19,20,21]. The adaptation strategy can be applied in a GVNS in both the shaking phase and improvement phase and is used in sustainable logistics by [22], but most articles use it only in the shaking phase of the GVNS [23,24,25]. Other adaptive strategies used with VNS in sustainable logistics are in a hybrid way, such as with a Genetic Algorithm (GA) [19,26], Particle Swarm Optimization (PSO) [27], an Electro-Magnetism Algorithm (EMA) [28], or an Artificial Bee Colony (ABC) [29,30]. Another way to use adaptivity in VNS using sustainable logistics, such as in [31], is with a mechanism that automatically chooses between the first improvement and the best improvement strategies in the improvement phase of VNS (see [32]).
Other variants of VNS have few applications in sustainable logistics. The Skewed VNS (SVNS) is the version introduced by [33], where a move to a worse solution is admitted if it is only “slightly” worse and “sufficiently” distant from the current solution. Condition f ( x ) < f ( x ) is replaced by f ( x ) < f ( x ) α δ ( x , x ) for the appropriate value α and the function δ ( . , . ) . Parallel BVNS with SVNS are applied in network design for reverse logistics in [34] and in [35] for a routing problem minimizing emissions. A Skewed GVNS (SGVNS) is applied to solve a battery swap station location/routing problem with capacitated electric vehicles in [36]. SVNS is also applied to sustainable logistics in [37,38].
In the Variable Neighborhood Decomposition Search (VNDS) variant proposed in [6], after shaking the incumbent solution by changing some of its attributes, the local search works on the subproblem containing only the attributes that have been changed while keeping the remaining ones fixed. The size of the subproblem plays the role of the shaking neighborhood parameter. No publications on the application of VNDS in sustainable logistics have been found in the literature. The VNS Branching proposed by [39] is applied in [40] to an electric vehicle routing problem with time windows.
The simplest version of VNS is the Fixed Neighborhood Search (FNS), which considers a single neighborhood structure in the shake procedure and for the local search [41] and coincides with the first variant of the Iterated Local Search [42]. This method is applied in [43] to a routing distribution problem with drones. The Nested VNS (NVNS) consists of applying a VNS procedure to the solutions of a predefined neighborhood structure, rather than only to an initial solution [44,45]. If the main loop also uses VNS, the procedure is referred to as a two-level GVNS [46]. Some combinations of VNS variants could also be used, such as a General VNDS or a Skewed General VNDS [8], by replacing VNS with VNDS in GVNS or SGVNS, respectively. In the reviewed literature, no publications have been found on the application of these VNS variants in sustainable logistics.

3. Review Methodology

To address the research questions outlined in the previous section, a Systematic Literature Review (SLR) was performed to provide a thorough and detailed analysis of the current state of the art. This study followed the guidelines proposed by [47,48] to conduct an SLR. The methodology of this study comprises six steps:
  • Formulation of the search question and choice of keywords.
  • Definition of inclusion and extrusion criteria.
  • Search in databases.
  • Paper selection; discussion and analysis of the results.
  • Reporting of the results.
In the following, we detail each of these steps.

3.1. Question Formulation and Keywords Definition

The first step in this review is the definition of the research questions. In this regard, the aim of this research is to examine the existing state of the art dealing with sustainable logistics problems using VNS and to examine in which areas of logistics this metaheuristic has been applied most frequently and successfully, as well as to identify the most commonly used version and understand how it has been implemented.
Based on the research purpose, we have defined a list of keywords in order to localize and limit this study. In addition to Variable Neighborhood Search and VNS, we have considered two sets of keywords: those related to sustainability and those related to logistics. The first set contains the following: green, sustainable, environmental, closed-loop, reverse, electric, emissions, energy consumption, waste collection, and wind farm. The second set contains the following: logistics, transportation, supply chain, location, inventory, and scheduling. We have included the keyword waste collection in our search because waste management is a critical aspect of sustainability in logistics. Efficient waste collection systems directly contribute to reducing environmental impact by optimizing waste transport and disposal. In the context of sustainable logistics, the use of advanced optimization techniques like VNS can significantly enhance the efficiency of waste collection processes, making them more environmentally friendly and cost-effective. Regarding the keyword wind farm, we have included it because wind farms play a significant role in the transition to renewable energy, which is a key component of sustainable logistics. Optimizing the logistics associated with wind farm operations, such as the transportation and installation of wind turbines, can lead to significant improvements in efficiency and sustainability. The application of VNS to wind farm-related logistics problems helps minimize transport costs, reduce emissions, and enhance the overall effectiveness of renewable energy projects.

3.2. Definition of Inclusion and Exclusion Criteria

In addition to the keywords identified in the initial step, we established a list of inclusion and exclusion criteria to refine the literature search and determine the articles to focus on. Table 1 presents these criteria.

3.3. Search in Databases

Once the keywords and criteria have been defined, the next step is the selection of the databases and the definition of the queries to be considered. We have selected the following source databases: Google Scholar, Web of Science, and Scopus. They have been chosen due to their comprehensive coverage of high-quality, peer-reviewed literature in the fields of logistics, optimization, and sustainability, as well as their global recognition as leading academic research platforms. We then started a data search of the various databases identified by creating the following query:
(“variable neighborhood search” OR vns) AND (green OR sustainable OR environmental OR “closed-loop” OR reverse OR electric OR emissions OR “energy consumption” OR “waste collection” OR “wind farm” ) AND (logistics OR transportation OR “supply chain” OR location OR inventory OR scheduling)
In Web of Science and Scopus, each term of queries was searched in the title, abstract, and keywords. At this point, we identified a first set of articles based on the relevance of the title according to the context of the study. A total of 226 articles were identified.

3.4. The Selection of the Most Relevant Papers

By implementing our inclusion and exclusion criteria, we identified the most pertinent studies for our focus and excluded those that were not relevant. During the selection process, we thoroughly reviewed the full text of each article and examined their references to conduct a secondary search. Subsequently, we included papers that were initially missed in our database search. Ultimately, a total of 171 papers were selected for review and analysis as key studies.
We recognize the following potential limitations of this review. While our review focused on peer-reviewed journals and conferences to ensure the reliability and rigor of the included studies, this approach may inadvertently exclude relevant unpublished or non-peer-reviewed work, such as technical reports or gray literature. Although peer review is a hallmark of quality, it may also contribute to underrepresentation of unconventional or preliminary research that could still hold value for this field. Regarding the database coverage, although we used leading databases, we acknowledge that no database can provide complete coverage of all relevant literature. Finally, despite a systematic approach, our focus on studies published in English and those directly addressing the integration of sustainability aspects into VNS applications may have excluded relevant contributions in other languages or related domains.

3.5. Analysis, Synthesis, and Results Reporting: Classification Methodology

After the relevant papers have been identified, steps 5 and 6 focus on synthesizing the literature and reporting the results. Each paper was thoroughly reviewed by both authors, and the fields presented in the table in Appendix A, along with two additional fields—the name of the journal and the year of publication—were extracted. These fields were carefully chosen to capture the most relevant aspects of VNS usage and its connection to sustainable logistics. Once all this information was collected, it enabled the authors to calculate the number of articles published per year, the distribution of articles across journals, and other statistical analyses used in the survey. This systematic approach ensured that the data were synthesized accurately and that the results presented are both reliable and representative of the field.
First, a descriptive analysis of the selected literature was performed, examining the distribution of the work over time and across various journals. In line with the research questions outlined in the first step, the papers were categorized based on the specific decision problems they addressed. Later, we deepen descriptions of the versions of the VNS used, the hybridization of the VNS with other methods, the multiobjective problems and approaches to solve it using VNS, and the uncertain and dynamics aspects considered. Finally, we present an analysis of the sustainability criteria.
In the subsequent sections, we conduct this thorough analysis of the literature identified based on the aforementioned categorizations. This enables us to ascertain the current trends about the use of VNS in sustainable logistics and identify research gaps in this field.

4. Results and Findings

Figure 1 illustrates the growth in the number of papers related to the topic of this study. As shown, there has been a significant increase in publications since 2019, underscoring the growing importance of VNS in the field of sustainable logistics. Note that the year 2024 presents a small decrease due to the date of the present study.
Regarding the journals where these studies are published, most of them belong to the areas of operations research, computer science, and engineering. The two most frequent journals are Computers & Operations Research and Computers & Industrial Engineering. Figure 2 shows the concept cloud created according to the number of papers published in each journal.
In terms of the optimization problem addressed, we have identified five primary types: routing, location, scheduling, location/routing, scheduling/routing, and network design. Additionally, a few papers focus on smaller categories such as inventory, lot sizing, and layout, which have been grouped under the category “Others”. As shown in Figure 3, the vast majority of papers using variants of VNS for sustainable logistics deal with routing problems, followed by scheduling.
In the following sections, we provide a more detailed analysis of the hybridization of VNS with other methods, explore multiobjective approaches that incorporate VNS, examine the consideration of uncertainty and dynamism in the studies, and conclude with an analysis of sustainability. For a more synthesized analysis, Appendix A includes a summary of the papers selected in this review and its characteristics.

4.1. VNS Version Analysis

A search on Scopus for the term “Variable Neighborhood Search” yields over 3000 works referencing this metaheuristic. However, many of these works do not explicitly mention the specific version of VNS used, making it necessary to perform a detailed content analysis to determine the version applied. Among the explicitly mentioned versions, BVNS is identified in approximately 80 articles. However, as observed in this study on sustainable logistics, it is likely that many of the works that do not specify a version implicitly use the basic version. The most frequently cited variant is VND, appearing in 540 articles. This popularity is due to its natural derivation from local search methods when different types of movements are considered. GVNS is explicitly mentioned in 213 works, while RVNS appears in 88. Notably, adaptive versions of VNS, such as AVNS or AGVNS, are referenced in 40 studies, with a significant concentration in recent years. Other notable variants include VNDS (37 articles) and SVNS (26 articles). Similar trends are reported in other surveys on VNS applications [49,50], further confirming these observations.
As illustrated in Figure 4, the most widely used VNS variants in sustainable logistics are BVNS and GVNS. VND is also frequently applied, as it naturally extends local search methods by incorporating changes in the movement applied. Several studies have used RVNS, which simplifies the search process by omitting the local search component. In recent years, the adaptability of metaheuristic designs has led to the emergence of various AVNS proposals. Other VNS versions have been applied in a limited number of studies, reflecting their more specialized or niche use cases.
The most challenging approach is the AVNS. Table 2 presents a chronological overview of the various studies on sustainable logistics that incorporate adaptability. The table categorizes the adaptability features based on their implementation in different phases of the VNS process or inside other optimization methods: in the shaking phase of the VNS, in the improvement phase of the VNS, in the selection of the next neighborhood, in the order in which neighborhoods are applied, in hybrid approaches deciding when VNS is applied, and in the search strategy (best improvement or first improvement). This table demonstrates that adaptability is most commonly utilized (marked with X) in the shaking and improvement phases of the VNS, with a particular emphasis on selecting the order in which neighborhoods are applied.
Specifically, in [19], a Memetic Algorithm (MA) incorporated AVNS as its local search heuristic to design a robust closed-loop global supply chain network for the medical device industry under uncertainty. Another hybrid heuristic combining AVNS with Tabu Search (TS) was developed in [14] to solve the problem of routing and locating multiple charging stations for electric vehicles within time windows.
AVNS has also played a significant role in multiobjective optimization for sustainable supply chain management. In [27], an adaptive multiobjective VNS was used to optimize a two-echelon multi-vehicle location/routing problem with time windows for sustainable food supply chains. Extending this approach, ref. [28] integrated the strategic allocation of sustainable orders with a supply chain network under stochastic demand. Furthermore, ref. [29] conducted a comparative analysis of a multiobjective AVNS against other evolving algorithms to design a sustainable supply chain network integrated with vehicle routing.
Pollution location inventory routing problems have also been tackled with adaptive VNS variations. Ref. [31] applied an adaptive version of BVNS, and subsequent works [23,24] explored additional adaptations. A hybrid combining AVNS and ALNS was used in [15] to address a multi-level location/routing problem with environmental considerations.
In urban logistics, AVNS has been effectively applied to optimize waste collection and routing systems. Ref. [21] proposed an AVNS for sustainable urban recycling with heterogeneous electric vehicles, while ref. [25] extended this methodology with AGVNS to optimize electric truck routing for milk collection. For green manufacturing systems, ref. [22] developed a double-adaptive GVNS to address unmanned electric vehicle routing and scheduling. Similarly, ref. [16] utilized AVNS to solve a green flexible job shop problem, aiming to minimize both makespan and total energy consumption.
Beyond supply chains and urban logistics, AVNS has been hybridized with other methods for innovative applications. Ref. [30] combined AVNS with ABC to develop a customer-oriented solution for multi-task green scheduling with diverse time-of-use pricing in cloud manufacturing. Ref. [17] employed a self-adaptive VNS to design a sustainable freight transportation network incorporating cross-docks. In healthcare logistics, ref. [18] applied AVNS to a home healthcare routing problem with heterogeneous electric vehicles and synchronization. Additionally, [26] demonstrated the use of AVNS for vehicle routing problems with time windows and carbon emissions in logistics distribution. Finally, ref. [20] optimized the locations and routing for battery swap stations for capacitated electric vehicles using AVNS.
This diverse body of research illustrates the growing relevance of AVNS and its variants across diverse sustainable logistics applications, from supply chain design to waste collection and beyond. Its hybridization with other optimization methods has further enhanced its ability to address complex, real-world challenges while balancing economic, environmental, and operational objectives.

4.2. Hybridization Analysis

Figure 5 illustrates the frequency with which VNS is hybridized with various optimization techniques across the selected pool of academic papers. Appendix A contains the correspondence between acronyms and full names. Among these methods, Simulated Annealing (SA) stands out as the most commonly combined with VNS. This is likely due to the ease with which the SA cooling schedule can be incorporated into the VNS stopping criteria, allowing a smooth integration that enhances the optimization process.
VNS is also frequently employed as a local search operator in other evolutionary algorithms, such as the GA, evolutionary algorithm (EA), and MA. In these cases, VNS is often applied after mutation and crossover operations, refining the solutions generated by these algorithms and improving their overall effectiveness.
The next in frequency is TS. In this hybridization, a tabu list is typically incorporated during the local search phase of VNS. The list is used to guide the selection of the next movement by preventing the algorithm from revisiting previously explored solutions, which promotes diversification and avoids local optima.
When it comes to matheuristics, which combine Exact Methods (EMs) with VNS, various strategies are possible depending on the specific problem being addressed. In some problems, an EM is used as a post-optimization technique to enhance the solutions obtained by VNS or to obtain an initial solution [51,52,53]. Other approaches involve using EMs to solve smaller parts of the problem inside the VNS [54,55]. In certain applications, such as scheduling/routing or location/routing problems, all these options are used to tackle distinct aspects of the problem, thus serving different roles within the overall algorithm [56].
A similar pattern can be observed for PSO and Ant Colony Optimization (ACO). These techniques can either be employed to act as the primary optimization methods with VNS, serving as a local search refinement [27,57,58,59], or address different stages of complex problems that are solved in conjunction, as seen in multiproblem scenarios [60].
In contrast, other algorithms appear to be combined with VNS far less frequently. Their hybridization occurs at a notably lower rate, suggesting that their integration has been less explored in the literature.

4.3. Multiobjective Analysis

Sustainable logistics inherently involves addressing multiple, often conflicting objectives, such as minimizing costs, reducing environmental impact, and ensuring social equity. These objectives reflect the three pillars of sustainability, which must be balanced to achieve effective and responsible logistics solutions. Multiobjective optimization methodologies are particularly relevant in this context, as they enable decision-makers to systematically explore and navigate trade-offs between these competing goals.
Of the 173 studies collected, 37 address multiobjective problems. In particular, studies focused on scheduling and network design are more likely to adopt multiobjective versions. These kinds of problems can be approached using various methods, each with its advantages and limitations. One of the simplest and most common techniques is to transform a multiple-objective problem into a single-objective one. This is typically accomplished through scalarization, where a weighted sum of the objectives is created, allowing for the adjustment of importance between the objectives by assigning different weights. By fine-tuning these weights, a decision-maker can explore different trade-offs between objectives, ultimately guiding the solution towards an optimal balance. Due to its simplicity, the number of studies using this kind of approach is among the highest in the context of this review [16,29,61,62,63,64,65,66,67].
Another approach is the ϵ -constraint method, which involves selecting one of the objectives as the primary goal to be optimized while treating the other objectives as constraints with varying upper bounds (right-hand side values). By systematically adjusting these constraints, multiple Pareto-optimal points can be generated, each representing a different compromise between competing objectives. This method provides a structured way to explore the Pareto front, offering a range of solutions that reflect different priorities.
Mathematically, the ϵ -constraint method can be expressed as:
min f 1 ( x ) , subject to : f i ( x ) ϵ i , i { 2 , , k } , x X
where f 1 ( x ) is the primary objective and ϵ i represents upper bounds for the secondary objectives f i ( x ) . In the context of VNS for sustainable logistics, it is less frequently used [68,69]. This may be due to the high number of executions necessary to obtain the Pareto front changing the corresponding constraint, which makes it a laborious task.
A powerful technique for handling multiobjective optimization is the use of achievement scalarizing functions (ASFs). This method allows decision-makers to specify a target or aspiration level for each objective, and then the optimization process seeks to minimize the distance between the current solution and this desired achievement.
Mathematically, the ASF can be represented as:
min S ( x ) = max i { 1 , , k } w i · f i ( x ) z i f i max f i min , x X
where z i is the aspiration level for the i-th objective and w i represents weights reflecting the decision-maker’s preferences. The ASF generates a scalar value for each solution, representing how well it aligns with the defined aspiration levels, and the solution that minimizes this value is selected as optimal.
The flexibility of this method makes it useful for problems where decision-makers have specific performance targets for each objective. However, it is rarely applied in VNS-related studies for sustainable logistics [70].
In addition to approaches that transform the problem into a single-objective one, there is the option of addressing the problem as truly multiobjective from the outset. This direct approach allows the simultaneous optimization of all objectives without reducing them to a single aggregated function. In this context, evolutionary algorithms are commonly used to explore the solution space. These algorithms can generate an approximation of the Pareto set, which consists of non-dominated solutions representing the best possible trade-offs between competing objectives. This approach is used significantly more frequently than any other in our context [27,28,30,34,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86]. This may be due to the fact that one of the key advantages of directly addressing a problem as multiobjective is that it provides a diverse set of solutions, giving decision-makers the flexibility to choose an option that best fits their specific priorities or constraints, rather than being constrained by predefined weights or scalarized objectives. This approach is especially beneficial in complex problems where the objectives may conflict or be difficult to reconcile through simple weighting or constraint-based methods.
Another well-established method for directly addressing multiobjective problems is compromise programming, which aims to find solutions that are as close as possible to the ideal solution—a hypothetical point where all objectives are optimized simultaneously. In practice, such an ideal solution rarely exists, as objectives often conflict. However, compromise programming seeks to minimize the distance between feasible solutions and this ideal point by using distance metrics such as the L1 (Manhattan distance) or L2 (Euclidean distance) norms.
The mathematical formulation is:
L p ( x ) = i = 1 k w i · f i ( x ) f i * f i max f i min p 1 / p
where f i * represents the ideal value of objective i. The chosen norm (p) reflects the decision-maker’s tolerance for trade-offs between objectives. In this method, the decision-maker specifies a preferred balance between objectives, and the algorithm then searches for solutions that are closest to this ideal according to the chosen norm. Therefore, this approach is particularly effective when the decision-maker has a clear understanding of the relative importance of each objective but still wants to explore solutions that lie near the ideal trade-off between them. Regrettably, this is not a common situation, as reflected by the number of approaches that use it in our context [87,88].
Finally, another technique for solving multiobjective problems is the lexicographic order method, which prioritizes the objectives according to their importance. In this approach, the objectives are ranked in hierarchical order, and the optimization process focuses first on the most important objective. Once an optimal solution is found for the highest-priority objective, the second most important objective is optimized, but only within the set of solutions that maintains optimality for the first. This process continues down the hierarchy, optimizing each subsequent objective without sacrificing the optimality of higher-priority ones.
Therefore, the lexicographic approach is expressed as a sequence of optimization problems:
(4) min f 1 ( x ) , x X , (5) min f 2 ( x ) , x X such that f 1 ( x ) = f 1 * , (6)
This method is particularly useful when one or more objectives are clearly more critical than others and there is a need to maintain strict priority among them. However, one limitation of this method is that it can disregard potentially good trade-offs for lower-priority objectives, as it strictly adheres to the ranked order. This, along with the need to establish the critical order, makes it less popular in the pool of studies analyzed [69,89,90].
Figure 6 shows the distribution of the collected studies according to the multiobjective method. All these methods balance theoretical rigor with practical applicability. For example, scalarization techniques are straightforward and computationally efficient, making them ideal for preliminary studies or contexts with limited computational resources. On the other hand, approaches such as the lexicographic method and compromise programming offer structured ways to address problems with clear priority hierarchies or trade-offs, which are often encountered in sustainability-related decision-making scenarios.

4.4. Uncertainty and Dynamism Analysis

From the body of studies analyzed, only a limited number address uncertainty or dynamic factors in sustainable logistics problems, despite their critical impact on the effectiveness of the solution. Various sources of uncertainty are considered depending on the specific problem and the field of application. For instance, in [54], the authors tackle a location problem where vehicle travel costs and CO2 emissions are uncertain, managed through a simulation-based optimization approach. Similarly, refs. [91,92] examine location/routing issues under uncertain conditions: Ref. [91] focuses on electric vehicle battery swap stations with fluctuating customer demand, applying two extended recourse policies to mitigate route failures. Meanwhile, ref. [92] employs a robust optimization framework to handle stochastic customer locations in a more generalized problem setting.
In network design, ref. [28] considers the uncertainty introduced by stochastic demand from retailers, applying a scenario-based stochastic model to address these variations. In routing, diverse uncertainties are managed in studies by [93,94,95]. Ref. [93] addresses pickup demand uncertainty through a two-stage method: initially estimating the pickup demands to create preliminary routes and then simulating these routes under real-time constraints and dynamically adjusting the unmet demands. In [94], service time uncertainty is tackled with robust optimization, while ref. [96] uses a simheuristic algorithm to manage unpredictable waste levels in a waste collection scenario. Additionally, ref. [95] considers energy consumption uncertainty in a similar context, employing robust optimization to create reliable routes.
Dynamic elements are even less frequently addressed. In [97], a routing problem for electric vehicles with dynamically arriving customers is managed through periodic re-optimization, transforming the dynamic situation into a sequence of static subproblems. Likewise, ref. [98] applies a dynamic programming algorithm to a scheduling problem influenced by dynamic disruptions, such as new order arrivals, variable raw material release times, and machine breakdowns.
Although uncertainty and dynamism are recognized as crucial factors in sustainable logistics, they remain underrepresented in optimization research where VNS is used. Studies that consider these elements rely on a range of advanced techniques, including robust and simulation-based optimization, scenario planning, and dynamic programming, each tailored to manage specific types of variability. However, the limited focus on these factors indicates a gap in the comprehensive integration of uncertainty and dynamism in sustainable logistics using VNS, particularly for complex real-world applications.

4.5. Sustainability Analysis

Sustainability in a logistic research publication is identified by including measures to evaluate and focusing on some of the aspects that are directly related to sustainability. As mentioned in the introduction, there are three aspects of sustainability: economic, environmental, and social sustainability. By considering optimization, the efficient management of resources is somehow taken into account in the final set of selected papers. Costs are part of models since this is the key aspect to guarantee the continuity of business and industries. This, jointly with the kinds of keywords used in the search, involves that the whole set of papers takes into account economic sustainability. Additionally, by considering the first set of keywords, environmental sustainability is also included in all the papers. However, social sustainability is less frequently considered in the research, and only a few papers take it into account.
The existing literature reveals that different studies adopt varying criteria depending on the specific problem, application, and context, making it challenging to establish a universal efficiency criterion applicable to all cases. Our methodology reflects this diversity by analyzing sustainability-related criteria individually, such as cost efficiency, environmental impacts, and social considerations, as these are tailored to the unique goals of each study.
In the following, we analyze the different criteria used to include the three aspects in the models and algorithms.

4.5.1. Economic Criteria

As previously mentioned, cost is a critical factor that is considered either directly or indirectly in all selected papers. Regardless of the specific optimization problem, cost minimization plays a central role in determining the efficiency and feasibility of the proposed solutions.
In the context of location problems, costs often encompass a variety of factors. These typically include the expenses associated with the installation of new facilities and the distances between demand points and their nearest service locations [54,99,100,101]. Minimizing these distances is crucial, as it directly impacts transportation costs, which are a major component of overall operational expenses in logistics networks. In some cases, other factors such as land acquisition and facility setup costs are also considered [71], especially when multiple locations are involved in the optimization process.
When it comes to vehicle routing problems, costs are generally reduced by minimizing travel time or total travel distance, as shorter routes result in lower fuel consumption and fewer operational expenses. In some papers, the cost model is further expanded to account for emissions and fuel costs, particularly in cases where sustainable logistics practices are a focus [35,57,102,103,104]. Additionally, penalties are sometimes incurred for specific operational inefficiencies, such as early or late arrivals (earliness or tardiness) and unscheduled stops or visits [105,106,107]. These penalties can significantly increase overall costs and are important to consider in routing scenarios where time windows or service guarantees are critical. The number of vehicles used is another potential cost factor, although it is less frequently considered [108,109]. However, when included, the size of the fleet directly impacts both capital expenditure and ongoing operational costs, such as driver wages and vehicle maintenance.
In scheduling problems, cost reduction is often linked to the minimization of the makespan—the total time required to complete all tasks or jobs. By reducing the makespan, companies can optimize resource allocation, increase throughput, and lower operational expenses such as labor and machine costs. In some cases, scheduling papers also factor in other costs related to delays or downtime, which can impact overall productivity [30,78].
Network design problems, on the other hand, tend to involve the most complex cost structures due to the multitude of elements involved in the optimization process. These problems typically integrate a wide range of costs, combining transportation expenses between different facilities, the costs associated with opening and operating facilities at different levels, and penalties related to tardiness in meeting delivery deadlines [34,62,63]. Furthermore, network design models often have to account for the fixed and variable costs of maintaining facilities over time, as well as any logistics costs associated with managing inventory, handling products, and maintaining service levels across the network [17,64,110].
In many cases, these cost components are interrelated, and the trade-offs between them must be carefully considered in the optimization process. For example, opening additional facilities may reduce transportation costs by shortening delivery routes, but it also increases fixed facility costs. As a result, papers addressing network design often present highly sophisticated cost models that balance these competing factors to find the most cost-effective solution for complex supply chain and logistics problems.

4.5.2. Environmental Criteria

In the context of the use of VNS for sustainable logistics, we have identified several key environmental aspects that are commonly addressed in research. We have further categorized each paper based on these specific aspects. To facilitate this, we considered 11 distinct fields:
  • Electric vehicles: This category includes papers that explore the use of electric vehicles (EVs), which are pivotal in reducing the environmental impact of logistics by minimizing reliance on fossil fuels.
  • Emissions: Papers in this group focus on strategies to minimize emissions, such as carbon dioxide, nitrogen oxides, and particulate matter, from transportation and logistics operations, highlighting the importance of cleaner and greener practices.
  • Waste collection: This category encompasses studies dedicated to optimizing waste collection systems, improving efficiency while ensuring sustainable waste management practices.
  • Energy consumption: Papers classified here address the reduction in energy consumption within logistics operations. Some of these studies involve mixed fleets that combine traditional and alternative energy sources, with a focus on improving overall energy efficiency.
  • Drones: This field includes research that explores the use of electric drones for logistics, which offers the potential for lower emissions and greater efficiency in last-mile delivery, particularly in urban or remote areas.
  • Reverse logistics: Papers in this category focus on reverse logistics processes, which involve the return of goods from consumers to producers, and emphasize sustainable practices such as recycling and reusing products.
  • Closed-loop logistics: This category includes studies that look into closed-loop logistics systems, which are designed to ensure products are reused or recycled, minimizing waste and reducing the need for raw materials.
  • Clean energies: This field encompasses papers exploring the use of clean energy sources such as wind farms, biomass energy, and photovoltaic (solar) energy within logistics, aiming to reduce the environmental footprint of operations.
  • Sustainable Tourism: Studies in this category focus on the intersection of logistics and sustainable tourism, addressing how transportation and logistics systems can support environmentally responsible travel practices.
  • Noise pollution: This group includes papers that address the issue of noise pollution, which is an often-overlooked aspect of sustainability in logistics, focusing on strategies to reduce noise emissions from transportation vehicles and operations.
  • Wastewater collection: Finally, papers related to wastewater collection explore logistics systems that are designed to manage and transport wastewater in a sustainable manner, minimizing environmental impact and optimizing infrastructure.
By organizing the papers into these 11 categories (see Table A1), we provide a clearer understanding of how environmental criteria are integrated into various logistics problems using the VNS and highlight the diverse ways in which environmental concerns are being addressed in the field. Figure 7 shows the distributions of papers according to these categories. Among these various fields, the use of electric vehicles and the reduction in carbon emissions are the most frequently considered in the literature. This reflects the growing global emphasis on decarbonizing the transportation sector and transitioning toward greener logistics practices.

4.5.3. Social Criteria

From the set of selected papers, only a limited number directly address social aspects within the scope of optimization problems. However, those that do tend to focus on important human-centered criteria, particularly when dealing with scheduling problems. For instance, one factor is the minimization of repetitive occupational actions, which aims to reduce worker fatigue and the risk of long-term injuries associated with repetitive tasks [82]. Another social criterion that is incorporated is the level of worker satisfaction, which reflects the importance of employee well-being in operational decision making and seeks to balance productivity with a positive and sustainable work environment.
In the realm of network design and distribution optimization, several social aspects come into play. One notable criterion is the creation of fixed job opportunities, which highlights the potential for new facilities and infrastructure to provide stable employment in the surrounding community [64,84]. This is often linked to broader goals of fostering regional economic development, ensuring that the expansion of logistics and supply chain networks has a positive socio-economic impact. Moreover, worker safety is an important concern, particularly during both the establishment of new facilities and the initial stages of operation [64]. Research in this area often emphasizes the need to design processes and facilities that minimize hazards and promote a safe working environment.
In the context of vehicle routing problems, route balance in terms of time or distance can be considered as a social criterion, since drivers feel a fair distribution of work [38]. Another critical social consideration is the reduction in accident risks [35]. This is particularly relevant in urban logistics and last-mile delivery, where the higher density of traffic increases the likelihood of accidents. By optimizing routes not only for efficiency but also for safety, these studies aim to minimize the exposure of drivers and other road users to potentially dangerous situations. This approach highlights the importance of integrating social and safety considerations into operational planning, ensuring that logistic systems do not compromise the well-being of those involved or impacted by processes.
Overall, while the number of papers that address these social dimensions is relatively small compared to environmental and economic factors, the integration of social criteria, such as worker well-being, safety, job creation, and accident risk reduction, reflects an important shift towards more holistic and sustainable decision making in logistics and supply chain management.

5. Research Trends and Gaps

The analysis of the current literature on the use of VNS in sustainable logistics reveals several trends and gaps that point to future opportunities for research in this area. Some trends are summarized in the following points.
  • Growth in publications. As illustrated in Figure 1, there has been a notable rise in the number of publications on VNS in sustainable logistics since 2019. This trend reflects the increasing awareness and recognition of optimization methods like VNS in addressing complex and pressing challenges in logistics systems while promoting sustainability. The rapid growth in interest highlights the broadening application of VNS techniques in response to the global demand for more sustainable and efficient logistics practices.
  • Dominance of operational research and computer science journals. The majority of studies in this field are published in journals related to operations research, computer science, and engineering. Journals such as Computers & Operations Research and Computers & Industrial Engineering are particularly prominent, as depicted in Figure 2.
  • Focus on routing and scheduling. The optimization problems most frequently addressed in the reviewed studies are routing and scheduling. As shown in Figure 3, the majority of papers using VNS target these two areas, underlining their centrality in sustainable logistics. These problems are essential for reducing transportation costs, improving efficiency, and minimizing environmental impacts, all of which are core elements of sustainable logistics practices.
  • Multiobjective optimization. An expanding body of research focuses on multiobjective problems where VNS is applied to simultaneously optimize conflicting objectives. These studies are vital for developing logistics systems that not only minimize costs but also integrate sustainability considerations such as emissions reduction, energy efficiency, and resource conservation. Multiobjective approaches remain highly relevant as they enable decision-makers to balance economic, environmental, and social goals in logistics systems.
  • Hybridization with other methods. A significant trend is the hybridization of VNS with other optimization techniques. As indicated in Figure 5, methods such as SA, TS, and GA are commonly combined with VNS to improve solution quality. This hybridization enhances flexibility and facilitates the exploration of complex optimization problems.
  • Prevalence of VNS variants. GVNS and BVNS remain the most widely used VNS variants, with a growing interest in the use of AVNS over the past few years.
Regarding research gaps and future research directions, we summarize the following points:
  • Lack of focus on uncertainty and dynamism. While uncertainty and dynamism are critical factors in sustainable logistics, few studies incorporate these elements into VNS-based models. Uncertainty in demand, travel times, and environmental conditions, as well as the dynamic nature of logistics networks, can substantially impact optimization algorithms. Future research could explore robust optimization techniques and dynamic adaptation mechanisms to make VNS more applicable to real-world logistics challenges.
  • Limited exploration of social sustainability. Although economic and environmental sustainability are often addressed in VNS-based logistics optimization, the social dimension remains underrepresented. Social factors, such as worker well-being, job creation, and safety, require more attention in the literature. Including these social metrics in optimization models is essential to ensuring logistics practices are socially responsible and equitable.
  • Innovation in hybridization techniques. While VNS has been successfully combined with various methods, further innovation in hybridization strategies is needed. Incorporating emerging technologies such as machine learning and reinforcement learning into VNS frameworks has received limited attention but holds significant potential for advancing sustainable logistics.
  • VNS variants. The proliferation of VNS variants and terminologies necessitates a more structured classification. Additionally, some researchers label their methods as VNS when applying neighborhood-based searches, even when they primarily use local search strategies. A systematic clarification of these methodologies would enhance understanding and consistency in the field.
  • Broader integration of sustainability metrics. While environmental sustainability remains a central focus, optimization models often lack comprehensive metrics. Factors such as resource efficiency, waste minimization, and community impact should be incorporated into future models to provide holistic solutions.
  • Need for comprehensive benchmarks and standardization. A major challenge in applying VNS to sustainable logistics is the absence of standardized benchmarks and performance metrics. Standardizing problem definitions, datasets, and evaluation metrics would improve the comparability of results across studies and facilitate a clearer understanding of the strengths and limitations of VNS approaches.
  • Emerging areas of application. New application domains for VNS in sustainable logistics are emerging, including renewable energy logistics, last-mile delivery using drones, and sustainable tourism optimization. Exploring and adapting VNS techniques to these novel challenges will expand their applicability and foster innovation in logistics research.

6. Discussion

VNS offers several advantages when addressing sustainable logistics problems. Its metaheuristic nature allows it to tackle large-scale, combinatorial optimization problems efficiently. The systematic exploration of neighborhood structures ensures a balance between exploration and exploitation, making VNS particularly suitable for problems with complex, multimodal solution landscapes. Furthermore, VNS is flexible and can be hybridized with other optimization methods, enhancing its applicability to multiobjective problems and dynamic scenarios. However, VNS is not without limitations. One drawback is its dependency on the definition and size of neighborhood structures, which can significantly influence the algorithm’s performance. Poorly chosen neighborhoods may lead to suboptimal solutions or increased computational time. Another limitation is that VNS is inherently heuristic, meaning that it does not guarantee finding the global optimum. Moreover, implementing VNS for real-world logistics problems requires domain-specific knowledge to properly adapt the algorithm, which can pose challenges for practitioners without sufficient expertise.
When using VNS, practitioners must carefully define problem-specific parameters, such as neighborhood structures and shaking mechanisms, to achieve desired results. The method’s reliance on computational power can also become a bottleneck for very large-scale problems or scenarios involving real-time decision-making. Recommendations for improving its application include integrating VNS with advanced machine learning techniques to enhance parameter tuning and combining it with robust optimization frameworks to address uncertainty in logistics data. While VNS is a powerful optimization tool, alternative methods such as GA, TS, and PSO are also widely used in sustainable logistics. GAs, for instance, offer strong exploratory capabilities due to their population-based approach, but they may struggle with convergence speed. TS provides effective intensification strategies but can become trapped in local optima without proper diversification. PSO, on the other hand, is efficient for continuous problems but may require additional adaptation for discrete or combinatorial problems. Compared to these methods, VNS stands out for its structured search and adaptability, although the choice of the method should ultimately depend on the problem characteristics and computational resources available.
One noteworthy observation from our analysis is the prevalent approach to formulating optimization problems where the objective is often defined as the minimization of a composite function. Specifically, many studies focus on reducing a sum of diverse cost components, and in certain cases, this objective incorporates a linear combination of multiple cost factors and sustainability metrics to evaluate the solution’s overall impact. In some studies, an economic valuation of some effect contrary to sustainability, such as emissions or other collateral effects, is used. Such optimization problems could, and in some cases should, be treated as multiobjective problems, where the optimization of a linear combination of objectives being only one of the possible alternatives to address it. There are not many articles in the literature on the application of VNS alone to address multiobjective problems, both in sustainable logistics and in other areas, but the use of hybrids of two or more metaheuristics is more frequent, with some VNS versions being one of them.
A key issue in the design and application of VNS is the choice of the series of neighborhood structures to use and also the order in which they are applied. Originally, it was recommended to use them by size or in order of complexity, from smallest to largest size or from least to most complex [7]. Different strategies have also been studied to change the neighborhood structure different from the original sequential change step, such as the cyclic, pipe, and skewed change step ([11]).
However, very few authors of papers justify the choice of the neighborhood structures to include in the VNS implementation they apply. In general, for any optimization problem, a large number of different structures can be devised, but only a few are chosen. The selected structures must be those that contribute significantly to the good performance of the procedure, discarding those that do not provide an additional contribution to those already considered. This must be accomplished through an experimental study on a sufficiently significant bank of instances using statistical techniques such as Factor Analysis or Principal Component Analysis. For example, some researchers use, say, eight or even more structures in their proposal. We should ask ourselves if similar results could be obtained for a subset of these structures. The simplicity and effectiveness that are at the heart of the original VNS proposal [8] have led to the formulation of the “Less is More” approach [111].
Unfortunately, this experimentation is not usually conducted due to the high computational costs of an exhaustive analysis and because it generally contributes little to what the experts’ or authors’ intuitions dictate. This same methodology should also be applied when considering hybrids or incorporating elements of other metaheuristics, as is frequently the case with tabu lists (TSs) or acceptance functions (SAs). When proposing a hybrid method, it must be proven that it provides advantages over each of them separately.
These techniques should also be applied to decide the order in which the different environment structures are applied within the VNS, either for agitation or enhancement or even both. It should also be used for the selection of the best improvement versus the first improvement strategy [32].
A step further along this line involves the proposals that try to incorporate AI procedures so that the algorithm itself automatically keeps the structures and movements that are relevant, discarding those that are superfluous. In this sense, adaptive systems or versions have been proposed, in particular the methods known as AVNS, which generally use a weighting system for the different structures or movements based on the number and intensity of the improvements that are achieved by applying each of the structures considered.

7. Conclusions

The analysis of recent trends in the literature on VNS for sustainable logistics highlights key findings and future directions. Since 2019, there has been a significant increase in publications on VNS, demonstrating its potential to tackle complex logistics challenges and promote sustainability. Most studies focus on routing and scheduling problems, which are critical for reducing costs and environmental impacts. The most frequently used VNS variants are GVNS and BVNS. Additionally, the growing interest in multiobjective optimization reflects the increasing need to achieve a balance between economic, environmental, and social goals in logistics systems. The hybridization of VNS with techniques such as SA, TS, and GA has enhanced both flexibility and solution quality for complex logistics problems.
However, significant gaps remain. One key gap is the underrepresentation of uncertainty and dynamism in VNS models, despite their relevance to real-world logistics networks with fluctuating demand and variable travel times. Future research should explore robust optimization methods and dynamic adaptation mechanisms to improve the practical applicability of VNS.
Another critical gap is the limited focus on social sustainability, in contrast to the more frequently addressed economic and environmental dimensions. Aspects such as worker well-being, safety, and job creation must be integrated into models to promote socially responsible logistics practices. Moreover, there is significant potential to innovate by combining VNS with emerging technologies, such as machine learning and reinforcement learning, which could help address the complexities of evolving logistics challenges.
The lack of standardized benchmarks and performance metrics for VNS in sustainable logistics is another challenge. Establishing common standards would facilitate more meaningful comparisons across studies and support the identification of strengths and weaknesses in VNS applications. Furthermore, while environmental sustainability is frequently addressed, broader integration of metrics such as resource efficiency and waste reduction is essential for achieving comprehensive optimization.
New application areas, including renewable energy logistics, last-mile delivery using drones, and sustainable tourism, offer exciting opportunities for advancing VNS research. Adapting VNS methods to address these novel challenges could pave the way for innovation and practical advancements.
This study also reveals areas for improvement and caution when implementing VNS. A critical insight is the prevalent focus on minimizing a composite function that combines cost factors and sustainability metrics. While this approach provides a straightforward framework, it often oversimplifies the interrelations and trade-offs inherent in sustainability-focused logistics problems. Treating such problems as genuinely multiobjective rather than relying solely on weighted linear combinations could yield richer solutions. Furthermore, the literature indicates that hybrid approaches involving VNS are more common than standalone applications for multiobjective problems, showcasing the importance of combining VNS with complementary methods for enhanced performance.
A recurring issue is the lack of systematic justification for key algorithmic choices in VNS implementations, such as neighborhood structures, their order of application, and the strategy for improvement selection. While expert intuition often guides these decisions, rigorous experimental validation is necessary to ensure the efficiency and effectiveness of the selected structures.
Emerging trends, such as the use of adaptive versions, offer promising avenues to enhance VNS. By incorporating AI techniques, these methods dynamically adjust the relevance of neighborhood structures based on performance, paving the way for more robust and automated optimization. However, this adaptability must also be backed by thorough experimentation to validate its impact on solution quality and computational efficiency.
In conclusion, while VNS remains a powerful and versatile tool for sustainable logistics, its success depends on carefully considered methodological choices, robust validation, and adaptation to the specific problem context. Addressing these aspects can significantly enhance the applicability and effectiveness of VNS, ensuring it remains a cornerstone for sustainable logistics optimization.

Author Contributions

Conceptualization, J.A.M.-P.; methodology, J.d.A.; validation, J.d.A. and J.A.M.-P.; formal analysis, J.d.A.; investigation, J.d.A.; resources, J.d.A.; data curation, J.d.A. and J.A.M.-P.; writing—original draft preparation, J.d.A.; writing—review and editing, J.A.M.-P.; visualization, J.d.A.; supervision, J.d.A.; project administration, J.d.A.; funding acquisition, J.d.A. and J.A.M.-P. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by MICIU/AEI/10.13039/501100011033 and Unión Europea NextGenerationEU/PRTR grant number RYC2021-032954-I.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ABCArtificial Bee Colony
ACOAnt Colony Optimization
ASFAchievement Scalarizing Functions
ABVNSAdaptive Basic Variable Neighborhood Search
AGVNSAdaptive General Variable Neighborhood Search
ALNSAdaptive Large Neighborhood Search
AVNSAdaptive Variable Neighborhood Search
BDBenders Decomposition
BPCBranch-and-Price-and-Cut
BVNSBasic Variable Neighborhood Search
CACellular Automata
CGColumn Generation
CMACellular Memetic Algorithm
CPCompromise Programming
DBCADensity-Based Clustering Algorithm
DCDivide and Conquer
DEDifferential Evolution
DESDiscrete Event Simulation
DGWODiscrete Genetic-Grey Wolf Optimization Algorithm
DWODiscrete Whale Optimization
EAevolutionary algorithms
EMExact Method
EMAElectro-Magnetism Algorithm
FAFirefly Algorithm
FSAFish Swarm Algorithm
GAGenetic Algorithm
GHGreedy heuristic
GRASPGreedy randomized adaptive search procedure
GTGame Theory
GVNSGeneral Variable Neighborhood Search
ICAImperialist Competitive Algorithm
IGIterated Greedy
IGWOImproved Gray Wolf Optimization Algorithm
ISSAImproved Sparrow Search Algorithm
LLearning
LBLocal Branching
MAMemetic Algorithm
MCSMonte Carlo Simulation
MOmultiobjective
PSOParticle Swarm Optimization
RVNSReduced Variable Neighborhood Search
SASimulated Annealing
SLPSustainable Logistic Problem
SLRSystematic Literature Review
SSScatter Search
SSHSpace-Saving Heuristic
SVNSSkewed Variable Neighborhood Search
TLBOTeaching-Learning-Based Optimization
TSTabu Search
VNSVariable Neighborhood Search
VNDVariable Neighborhood Descent
WOAWhale Optimization Algorithm

Appendix A. Summary of Papers Reviewed

Table A1 presents a summary of all the papers selected for the present review. Each column corresponds to the reference, the decision problem addressed, the field, if it deals with uncertainty (U), if it deals with dynamism (D), if it includes social sustainability criteria (SS), the objective function(s) considered, if it addresses a multiobjective problem (MO), the VNS variant used, and the method used for hybridization (if any). Note that a * in the objective column means that emissions are considered as part of the cost.
Table A1. Studies on logistics optimization using VNS.
Table A1. Studies on logistics optimization using VNS.
Ref.Decision ProblemFieldUDSSObjectiveMOVNS VariantHybrid
[99]Location/SchedulingElectric vehicles Min number of charging points GVNS
[112]LocationElectric vehicles Max profit GVNSGHs
[71]LocationElectric vehicles Min cost/Max coverageSequential VNDSS
[101]LocationElectric vehicles Min distance GVNS
[100]LocationReversed logistics Min travel cost BVNS
[54]LocationEmissions Min travel cost BVNSEM, MCS
[27]Location/RoutingEmissions Min cost/Min environmental impactAGVNSPSO
[14]Location/RoutingElectric vehicles Min cost AVNSTS
[20]Location/RoutingElectric vehicles Min cost AVNS
[31]Location/Routing/InventoryEmissions Min cost * ABVNS
[91]Location/RoutingElectric vehicles Min cost BVNSPSO
[23]Location/Routing/InventoryEmissions Min cost * AVNS
[24]Location/Routing/InventoryEmissions Min cost * AGVNS
[113]Location/RoutingElectric vehicles Min cost BVNS
[36]Location/RoutingElectric vehicles Min cost SGVNS
[114]Location/RoutingClean energies Min cost BVNSTS
[92]Location/RoutingEmissions Min cost * RVNSICA
[15]Location/RoutingEmissions Min cost * AGVNSALNS
[60]Location/RoutingElectric vehicles Min cost VNDACO
[115]Location/RoutingElectric vehicles Min cost BVNS
[116]Location/RoutingElectric vehicles Min cost GVNS
[117]Location/Routing/InventoryEmissions Min cost BVNS, GVNS with cyclicVND, pipeVND
[118]Location/RoutingWaste collection Min cost BVNSMA
[119]Location/RoutingElectric vehicles Min cost BVNS
[120]Location/RoutingElectric vehicles Min time GVNS
[121]Location/RoutingClean energies Min cost GVNSGA
[122]Location/RoutingClean energies Min cost GVNS
[123]Location/RoutingWaste collection Min cost BVNS
[124]Location/RoutingElectric vehicles Min distance BVNSGA
[125]Location/RoutingWaste collection Min cost VND
[87]SchedulingWind farm Min cost/Min completion periodBVNSCP, SA
[126]SchedulingEmissions Min CO2 emission VND/RVNS
[72]SchedulingNoise pollution Min makespan/Min noise pollutionBVNSCA
[127]SchedulingEnergy consumption Min cost RVNSDWO
[89]SchedulingCross-docking Min energy consumption/Min costBVNSSA, TS
[128]SchedulingEnergy consumption Min cost BVNSDWO
[73]SchedulingEnergy consumption Min makespan/Min energy consumptionVNDMAs
[61]SchedulingEmissions/Noise pollution Min completion time/Min energy consumptionBVNSIGWO, PSO
[129]SchedulingEnergy consumption Max net revenue GVNS
[74]SchedulingEnergy consumption Min makespan/Min worker cost/Min green indicatorVNDEA
[130]SchedulingEnergy consumption Min cost BVNSDGWO
[68]SchedulingEnergy consumption Min energy consumption/Min surplus stocksRVNSTLBO
[131]SchedulingEmissions Min carbon emissions RVNS
[98]SchedulingEnergy consumption Min energy consumption BVNS
[75]SchedulingEnergy consumption Min makespan/Min energy consumptionVNDTLBO
[76]SchedulingEnergy consumption Min makespan/Min energy costVNDEA
[132]SchedulingElectric vehicles Min cost GVNSBD
[133]SchedulingClean energy Min electricity consumption BVNSTS
[77]SchedulingEnergy consumption Min makespan/Min energy consumptionVNDCMA
[78]SchedulingEnergy consumption Min makespan/Min equipment load/Min energy consumption/Min delay time/Min processing qualityVNDEA
[134]SchedulingEnergy consumption Min cost VNDISSA
[16]SchedulingEnergy consumption Min makespan/Min energy consumptionAVNS
[79]SchedulingEnergy consumption Min makespan/Min energy consumptionVND
[30]SchedulingEnergy consumption Min energy consumption/Min earliness and tardinessAVNSABC
[102]SchedulingEnergy consumption Min energy consumption GVNSGA, EM
[80]SchedulingEnergy consumption Min makespan/Min energy consumptionVNDGA
[81]SchedulingEnergy consumption Min tardiness/Min energy cost/Min carbon trading costGVNSEA, L
[82]SchedulingEnergy consumption Min makespan/Min maximum occupational repetitive action index/Max minimum level of satisfaction of all workers/Min energy consumptionBVNSGA, L
[83]Scheduling/RoutingEmissions Min tardiness/Min energy consumptionBVNSEA
[135]Scheduling/RoutingEmissions Min cost * VNDGA, SA
[136]Scheduling/RoutingElectric vehicles Min travel time BVNS and VNDEA
[137]Scheduling/RoutingEmissions Max profit BVNS
[22]Scheduling/RoutingElectric vehicles Min travel time AGVNS
[138]Scheduling/RoutingElectric vehicles Min cost BVNSBPC, CG
[52]Scheduling/RoutingWind farm Min cost BVNSEM
[139]Scheduling/RoutingElectric vehicles Min cost BVNS
[18]Scheduling/RoutingElectric vehicles Min cost AVNSGRASP
[34]Network designReversed logistics Min cost/Min tardiness/Min pollutionParallel BVNS with SVNS
[84]Network designClosed-loop logistics Min cost/Min environmental impact/Max job opportunitiesRVNSICA
[62]Network designReversed logistics Min cost/Min tardinessBVNS
[28]Network design (and order allocation)Emissions Min cost/Min environmental impactABVNSAdaptive MO-EMA
[19]Network designClosed-loop logistics Max total net present value ABVNSGA
[29]Network designEmissions Min cost/Min environmental impact and social impactsABVNSPSO, EMA, ABC, GA
[63]Network designReversed logistics Min cost/Min tardinessRVNS
[64]Production/Distribution/
Inventory/Allocation/Location
Emissions Min cost/Max social factorsBVNSACO, FSA, FA
[140]Network designEmissions Max profit GVNSGT
[110]Network designEmissions Min cost * GVNSSA
[88]Network designClosed-loop logistics Min cost/Min carbon emissionsBVNSCP
[65]Network designClosed-loop logistics Min cost/Max crop yield and phosphorus useBVNSWOA
[17]Network designEmissions Min cost * Two-Level AVNS
[66]Network designWastewater collection Min cost/Min energy comsuptionBVNSDC
[141]Network designEmissions Min cost/Min emissions BVNSGA
[85]Network designElectric vehicles Min avg travel time/Min number of stationsMO-VNS
[142]RoutingWaste Collection Min time VND
[143]RoutingWaste Collection Min time/distance VNDTS
[144]RoutingWaste Collection Min time BVNSSA
[145]RoutingWaste Collection Min cost BVNSEM
[146]RoutingElectric vehicles Min distance BVNSTS, SA
[147]RoutingWaste Collection Min cost BVNSSA
[93]RoutingClosed-loop logistics Min cost GVNS
[148]RoutingReversed logistics Min distance GVNS
[40]RoutingElectric vehicles Min time VNS BranchingLB
[149]RoutingElectric vehicles Min distance VND
[51]RoutingEmissions Min cost BVNSEM
[57]RoutingEmissions Min cost * VNDACO
[96]RoutingWaste Collection Min cost BVNSMCS
[150]RoutingElectric vehicles Min time VNS BranchingLB
[151]RoutingEmissions Min fuel consumption GVNS
[94]RoutingWaste Collection Min time BVNS
[152]RoutingEmissions Min carbon emissions GVNS
[97]RoutingElectric vehicles Min distance GVNS
[153]RoutingElectric vehicles Min cost GVNS
[154]RoutingElectric vehicles Min distance GVNS
[86]RoutingEmissions Min emissions/Min delayGVNS
[35]RoutingEmissions Min traveling time + traveling distance + environmental cost + social cost SVNS
[155]RoutingEmissions Min cost GVNSEA
[156]RoutingWaste collection Max social welfare BVNSTS
[70]RoutingWaste collection Min total and maximum distanceGVNSIG
[157]RoutingEmissions Min cost BVNSPSO
[158]RoutingElectric vehicles Min cost GVNSSSH
[159]RoutingElectric vehicles Min cost IVNS
[160]RoutingElectric vehicles Min energy compsuption GVNS
[161]RoutingEmissions Min distance GVNSTS
[162]RoutingEmissions Min cost VNSGA, TS
[163]RoutingEmissions Min distance VNDACO
[164]RoutingWaste collection Min cost GVNS
[165]RoutingElectric vehicles Min cost GVNS
[166]RoutingElectric vehicles Min cost BVNSTS
[105]RoutingElectric vehicles Min time + TW deviation + unscheduled
visits + overtime
VND
[167]RoutingElectric vehicles Min cost GVNS
[90]RoutingEmissions Max number of customers served by PDs and ODs/Max usage rate of professional vehicles/Min unfairness of PD routes/Min cost of operating cost ODsMemory-based GVNS
[168]RoutingEmissions Min cost VNDACO
[169]RoutingWaste collection Min cost BVNSACO
[21]RoutingWaste collection Min cost AVNS
[69]RoutingSustainable tourism Max profit/Min cost/Min emissionsGVNS
[43]RoutingDrones Min cost ILS
[170]RoutingElectric vehicles Min distance BVNSTS
[55]RoutingElectric vehicles Min cost BVNSEM
[171]RoutingElectric vehicles and drones Min energy consumption VNDACO
[172]RoutingElectric vehicles Min distance RVNS
[173]RoutingElectric vehicles Min distance GVNS
[174]RoutingWaste Collection Min cost GVNSSA
[104]RoutingEmissions Min cost * RVNS
[37]RoutingEmissions Min cost GVNS
[38]RoutingEmissions Min cost RVNSSA
[175]RoutingSustainable tourism Max number of tourists BVNSDE
[176]RoutingDrones Min energy consumption VNDGRASP
[67]RoutingDrones Min completion time/Min costs/Min truck emission/Min penaltyGVNSSA
[177]RoutingDrones Min final arrival time at the depot RVNS
[178]RoutingEmissions Min cost GVNS
[179]RoutingElectric vehicles Min cost GVNSDBCA
[108]RoutingElectric vehicles Min energy consumption + number of vehicles GVNSSA
[56]RoutingElectric vehicles Min cost BVNSEM
[106]RoutingElectric vehicles Min travel time + penalty for missing time windows GVNS
[180]RoutingElectric vehicles Min cost + number of vehicles BVNSSA
[25]RoutingElectric vechiles Min cost AGVNS
[109]RoutingElectric vehicles Min energy consumption + number of vehicles GVNSBSO, ACO
[181]RoutingEmissions Min emissions/Min vehicle cost/Min fuel consumption/Min delayVNDPSO
[182]RoutingEmissions Min carbon emissions GVNSGA
[183]RoutingEmissions Min carbon emissions BVNS
[26]RoutingWaste collection Min cost AVNSSA
[184]RoutingElectric vehicles and drones Min final completition time GVNS
[95]RoutingElectric vehicles Min recharging GVNSTS, SA, CG
[53]RoutingElectric vehicles Min cost GVNSEM
[185]RoutingElectric vehicles Min maximum distance traveled VNDGA, GH
[53]RoutingElectric vehicles Min cost GVNSEM
[186]RoutingElectric vehicles Min cost GVNS
[107]RoutingEmissions Min cost * Sequential VNDGA
[187]RoutingElectric vehicles Min cost GVNSACO
[103]RoutingDrones Min cost * Randomized VNS
[184]RoutingDrones Min completion time BVNS
[188]RoutingWaste collection Min cost GVNSGA, SA
[58]RoutingEmissions Min cost GVNSACO
[59]RoutingWaste collection Min cost VNDACO
[189]Routing/PackingEnergy consumption Min cost BVNSGRASP
[190]LayoutWind farm Min annual production cost per unit power BVNSGRASP
[191]InventoryReverse logistics Min cost BVNSTS, DES
[192]Lot sizingClosed-loop logistics Min cost GVNS
[193]Lot sizingReverse logistics Min cost GVNS variants
[194]Lot sizingReverse logistics Min cost VND
[195]LayoutWind farm Min transportation cost BVNSEM
[196]LayoutWind farm Max power production—wakes and foundation costs BVNS

References

  1. Ma, L.; Ghorbani, Y.; Kongar-Syuryun, C.B.; Khayrutdinov, M.M.; Klyuev, R.V.; Petenko, A.; Brigida, V. Dynamics of backfill compressive strength obtained from enrichment tails for the circular waste management. Resour. Conserv. Recycl. Adv. 2024, 23, 200224. [Google Scholar] [CrossRef]
  2. Zheng, Z.; Zhu, Y.; Zhang, Y.; Yin, P. The impact of China’s regional economic integration strategy on the circular economy: Policy effects and spatial spillovers. J. Environ. Manag. 2025, 373, 123669. [Google Scholar] [CrossRef]
  3. Mladenović, N. A variable neighborhood algorithm—A new metaheuristic for combinatorial optimization. In Proceedings of the Optimization Days, Montreal, QC, Canada, 10–12 May 1995; Volume 12, p. 234. [Google Scholar]
  4. Mladenović, N.; Hansen, P. Variable neighborhood search. Comput. Oper. Res. 1997, 24, 1097–1100. [Google Scholar] [CrossRef]
  5. Hansen, P.; Mladenović, N. Variable neighborhood search for the p-median. Locat. Sci. 1997, 5, 207–226. [Google Scholar] [CrossRef]
  6. Hansen, P.; Mladenović, N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 2001, 130, 449–467. [Google Scholar] [CrossRef]
  7. Hansen, P.; Mladenović, N.; Brimberg, J.; Pérez, J.A.M. Variable Neighborhood Search; Springer: Cham, Switzerland, 2019; pp. 57–97. [Google Scholar] [CrossRef]
  8. Brimberg, J.; Salhi, S.; Todosijević, R.; Urošević, D. Variable Neighborhood Search: The power of change and simplicity. Comput. Oper. Res. 2023, 155, 106221. [Google Scholar] [CrossRef]
  9. Hansen, P.; Mladenović, N.; Pérez, J.A.M. Variable neighbourhood search: Methods and applications. 4OR 2008, 6, 319–360. [Google Scholar] [CrossRef]
  10. Hansen, P.; Mladenović, N.; Pérez, J.A.M. Variable neighbourhood search: Methods and applications. Ann. Oper. Res. 2010, 175, 367–407. [Google Scholar] [CrossRef]
  11. Hansen, P.; Mladenović, N.; Todosijević, R.; Hanafi, S. Variable neighborhood search: Basics and variants. EURO J. Comput. Optim. 2017, 5, 423–454. [Google Scholar] [CrossRef]
  12. Hu, B.; Raidl, G.R. Variable neighborhood descent with self-adaptive neighborhood-ordering. In Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, Málaga, Spain, 16–17 November 2006. [Google Scholar]
  13. Polacek, M.; Benkner, S.; Doerner, K.F.; Hartl, R.F. A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. Bus. Res. 2008, 1, 207–218. [Google Scholar] [CrossRef]
  14. Wang, L.Y.; Song, Y.-B. Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle. J. Eng. Sci. Technol. Rev. 2015, 8, 190–201. [Google Scholar]
  15. Theeraviriya, C.; Ruamboon, K.; Praseeratasang, N. Solving the multi-level location routing problem considering the environmental impact using a hybrid metaheuristic. Int. J. Eng. Bus. Manag. 2021, 13, 18479790211017353. [Google Scholar] [CrossRef]
  16. Hamida, M.B.; Azzouz, A.; Said, L.B. An Adaptive Variable Neighborhood Search Algorithm to Solve Green Flexible Job Shop Problem. In Proceedings of the 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT), Rome, Italy, 3–6 July 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 1403–1408. [Google Scholar] [CrossRef]
  17. Mogale, D.G.; De, A.; Ghadge, A.; Tiwari, M.K. Designing a sustainable freight transportation network with cross-docks. Int. J. Prod. Res. 2023, 61, 1455–1478. [Google Scholar] [CrossRef]
  18. Cebeci, E.; Yücel, E.; Koç, Ç. The home health care routing with heterogeneous electric vehicles and synchronization. OR Spectr. 2024. [Google Scholar] [CrossRef]
  19. Hasani, A.; Zegordi, S.H.; Nikbakhsh, E. Robust closed-loop global supply chain network design under uncertainty: The case of the medical device industry. Int. J. Prod. Res. 2015, 53, 1596–1624. [Google Scholar] [CrossRef]
  20. Hof, J.; Schneider, M.; Goeke, D. Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops. Transp. Res. Part B Methodol. 2017, 97, 102–112. [Google Scholar] [CrossRef]
  21. Erdem, M. Optimisation of sustainable urban recycling waste collection and routing with heterogeneous electric vehicles. Sustain. Cities Soc. 2022, 80, 103785. [Google Scholar] [CrossRef]
  22. Liu, W.; Dridi, M.; Ren, J.; Hassani, A.H.E.; Li, S. A double-adaptive general variable neighborhood search for an unmanned electric vehicle routing and scheduling problem in green manufacturing systems. Eng. Appl. Artif. Intell. 2023, 126, 107113. [Google Scholar] [CrossRef]
  23. Karakostas, P.; Sifaleras, A.; Georgiadis, M.C. Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem. Expert Syst. Appl. 2020, 153, 113444. [Google Scholar] [CrossRef]
  24. Karakostas, P.; Sifaleras, A.; Georgiadis, M.C. Adaptive GVNS Heuristics for Solving the Pollution Location Inventory Routing Problem. In Learning and Intelligent Optimization; Matsatsinis, N.F., Marinakis, Y., Pardalos, P., Eds.; Springer: Cham, Switzerland, 2020; pp. 157–170. [Google Scholar] [CrossRef]
  25. Erdem, M. Optimisation of the electric truck route for milk collection problem: A real case study. Transp. Lett. 2023, 15, 193–210. [Google Scholar] [CrossRef]
  26. Luo, K.; Zhao, W.; Zhang, R. A multi-day waste collection and transportation problem with selective collection and split delivery. Appl. Math. Model. 2024, 126, 753–771. [Google Scholar] [CrossRef]
  27. Govindan, K.; Jafarian, A.; Khodaverdi, R.; Devika, K. Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int. J. Prod. Econ. 2014, 152, 9–28. [Google Scholar] [CrossRef]
  28. Govindan, K.; Jafarian, A.; Nourbakhsh, V. Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic. Comput. Oper. Res. 2015, 62, 112–130. [Google Scholar] [CrossRef]
  29. Govindan, K.; Jafarian, A.; Nourbakhsh, V. Designing a sustainable supply chain network integrated with vehicle routing: A comparison of hybrid swarm intelligence metaheuristics. Comput. Oper. Res. 2019, 110, 220–235. [Google Scholar] [CrossRef]
  30. Tong, H.; Zhu, J. A customer-oriented method to support multi-task green scheduling with diverse time-of-use prices in Cloud Manufacturing. Proc. Inst. Mech. Eng. Part B J. Eng. Manuf. 2023, 237, 911–924. [Google Scholar] [CrossRef]
  31. Karakostas, P.; Sifaleras, A.; Georgiadis, M.C. Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem; Springer: Cham, Switzerland, 2019; pp. 64–76. [Google Scholar] [CrossRef]
  32. Hansen, P.; Mladenović, N. First vs. best improvement: An empirical study. Discret. Appl. Math. 2006, 154, 802–817. [Google Scholar] [CrossRef]
  33. Hansen, P.; Jaumard, B.; Mladenović, N.; Parreira, A.D. Variable neighbourhood search for maximum weight satisfiability problem. Cah. Du GERAD 2000, 62, 1–27. [Google Scholar]
  34. Eskandarpour, M.; Zegordi, S.H.; Nikbakhsh, E. A parallel variable neighborhood search for the multi-objective sustainable post-sales network design problem. Int. J. Prod. Econ. 2013, 145, 117–131. [Google Scholar] [CrossRef]
  35. Reyes-Rubiano, L.; Calvet, L.; Juan, A.A.; Faulin, J.; Bové, L. A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems. J. Heuristics 2020, 26, 401–422. [Google Scholar] [CrossRef]
  36. Affi, M.; Derbel, H.; Jarboui, B.; Siarry, P. A Skewed General Variable Neighborhood Search Approach for Solving the Battery Swap Station Location-Routing Problem with Capacitated Electric Vehicles; Springer: Cham, Switzerland, 2020; pp. 75–89. [Google Scholar] [CrossRef]
  37. Fan, X.; Yao, G.; Yang, Y. Multi-Compartment Vehicle Routing Problem Considering Traffic Congestion under the Mixed Carbon Policy. Appl. Sci. 2023, 13, 10304. [Google Scholar] [CrossRef]
  38. Chen, T.; Chu, F.; Zhang, J.; Sun, J. Sustainable collaborative strategy in pharmaceutical refrigerated logistics routing problem. Int. J. Prod. Res. 2023, 62, 5036–5060. [Google Scholar] [CrossRef]
  39. Hansen, P.; Mladenović, N.; Urošević, D. Variable neighborhood search and local branching. Comput. Oper. Res. 2006, 33, 3034–3045. [Google Scholar] [CrossRef]
  40. Bruglieri, M.; Pezzella, F.; Pisacane, O.; Suraci, S. A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows. Electron. Notes Discret. Math. 2015, 47, 221–228. [Google Scholar] [CrossRef]
  41. Mladenović, N.; Hansen, P. A tutorial on variable neighborhood search. Les Cah. Du GERAD 2003, 711, 2440. [Google Scholar]
  42. Lourenço, H.R.; Martin, O.C.; Stützle, T. Iterated Local Search: Framework and Applications; Springer: Cham, Switzerland, 2019; pp. 129–168. [Google Scholar] [CrossRef]
  43. Wang, Y.; Wang, Z.; Hu, X.; Xue, G.; Guan, X. Truck—Drone hybrid routing problem with time-dependent road travel time. Transp. Res. Part C Emerg. Technol. 2022, 144, 103901. [Google Scholar] [CrossRef]
  44. Todosijević, R.; Benmansour, R.; Hanafi, S.; Mladenović, N.; Artiba, A. Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 2016, 252, 385–396. [Google Scholar] [CrossRef]
  45. Brimberg, J.; Mladenović, N.; Todosijević, R.; Urošević, D. A general framework for nested variable neighborhood search. Electron. Notes Discret. Math. 2017, 58, 159–166. [Google Scholar] [CrossRef]
  46. Mladenović, N.; Todosijević, R.; Urošević, D. Two level general variable neighborhood search for attractive traveling salesman problem. Comput. Oper. Res. 2014, 52, 341–348. [Google Scholar] [CrossRef]
  47. Durach, C.F.; Kembro, J.; Wieland, A. A New Paradigm for Systematic Literature Reviews in Supply Chain Management. J. Supply Chain Manag. 2017, 53, 67–85. [Google Scholar] [CrossRef]
  48. Aloui, A.; Hamani, N.; Derrouiche, R.; Delahoche, L. Systematic literature review on collaborative sustainable transportation: Overview, analysis and perspectives. Transp. Res. Interdiscip. Perspect. 2021, 9, 100291. [Google Scholar] [CrossRef]
  49. Sifaleras, A.; Konstantaras, I. A Survey on Variable Neighborhood Search Methods for Supply Network Inventory; Springer International Publishing: Cham, Switzerland, 2020; pp. 71–82. [Google Scholar] [CrossRef]
  50. Lan, S.; Fan, W.; Yang, S.; Pardalos, P.M.; Mladenovic, N. A survey on the applications of variable neighborhood search algorithm in healthcare management. Ann. Math. Artif. Intell. 2021, 89, 741–775. [Google Scholar] [CrossRef]
  51. Wang, K.; Shao, Y.; Zhou, W. Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service. Transp. Res. Part D Transp. Environ. 2017, 57, 262–276. [Google Scholar] [CrossRef]
  52. Irawan, C.A.; Ouelhadj, D.; Sperstad, I.B.; Jones, D. A combined tactical and operational framework for maintenance scheduling and routing in offshore wind farms. J. Oper. Res. Soc. 2023, 74, 2241–2260. [Google Scholar] [CrossRef]
  53. İslim, R.B.; Çatay, B. An effective matheuristic approach for solving the electric traveling salesperson problem with time windows and battery degradation. Eng. Appl. Artif. Intell. 2024, 132, 107943. [Google Scholar] [CrossRef]
  54. Imran, A.; Utomo, E.W.; Ramadhan, F.; Desrianty, A.; Helianty, Y.; Mustofa, F.H. A Simulation-Based Optimisation for the Stochastic Green Capacitated p-Median Problem. J. Ind. Eng. Manag. 2022, 15, 552–565. [Google Scholar] [CrossRef]
  55. Seyfi, M.; Alinaghian, M.; Ghorbani, E.; Çatay, B.; Sabbagh, M.S. Multi-mode hybrid electric vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 2022, 166, 102882. [Google Scholar] [CrossRef]
  56. Çatay, B.; Sadati, İ. An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping. Comput. Oper. Res. 2023, 159, 106310. [Google Scholar] [CrossRef]
  57. Jabir, E.; Panicker, V.V.; Sridharan, R. Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem. Transp. Res. Part D Transp. Environ. 2017, 57, 422–457. [Google Scholar] [CrossRef]
  58. Wang, Y.; Wei, Z.; Luo, S.; Zhou, J.; Zhen, L. Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows. Transp. Res. Part E Logist. Transp. Rev. 2024, 192, 103798. [Google Scholar] [CrossRef]
  59. Sahib, T.M.; Mohd-Mokhtar, R.; Mohd-Kassim, A. A comparative study utilizing hybridized ant colony optimization algorithms for solving dynamic capacity of vehicle routing problems in waste collection system. Teknomekanik 2024, 7, 38–61. [Google Scholar] [CrossRef]
  60. Leite, M.R.C.O.; Bernardino, H.S.; Gonçalves, L.B. Solving a Bilevel Problem with Station Location and Vehicle Routing Using Variable Neighborhood Descent and Ant Colony Optimization; Springer International Publishing: Cham, Switzerland, 2021; pp. 211–223. [Google Scholar] [CrossRef]
  61. Guo, H.; Li, J.; Yang, B.; Mao, X.; Zhou, Q. Green scheduling optimization of ship plane block flow line considering carbon emission and noise. Comput. Ind. Eng. 2020, 148, 106680. [Google Scholar] [CrossRef]
  62. Eskandarpour, M.; Nikbakhsh, E.; Zegordi, S.H. Variable neighborhood search for the bi-objective post-sales network design problem: A fitness landscape analysis approach. Comput. Oper. Res. 2014, 52, 300–314. [Google Scholar] [CrossRef]
  63. Yıldız, G.B.; Soylu, B. A multiobjective post-sales guarantee and repair services network design problem. Int. J. Prod. Econ. 2019, 216, 305–320. [Google Scholar] [CrossRef]
  64. Goodarzian, F.; Taleizadeh, A.A.; Ghasemi, P.; Abraham, A. An integrated sustainable medical supply chain network during COVID-19. Eng. Appl. Artif. Intell. 2021, 100, 104188. [Google Scholar] [CrossRef]
  65. Shokouhifar, M.; Sohrabi, M.; Rabbani, M.; Molana, S.M.H.; Werner, F. Sustainable Phosphorus Fertilizer Supply Chain Management to Improve Crop Yield and P Use Efficiency Using an Ensemble Heuristic–Metaheuristic Optimization Algorithm. Agronomy 2023, 13, 565. [Google Scholar] [CrossRef]
  66. Balamurugan, J.; Kasthuri, N.; Sudarsan, J.; Reddy, A.B.; Someshwar, S.; Sakhare, D.; Sampathkumar, V. An efficient wastewater collection model for groundwater resource protection in smart cities. Groundw. Sustain. Dev. 2024, 25, 101091. [Google Scholar] [CrossRef]
  67. Teimoury, E.; Rashid, R. A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations. J. Heuristics 2023, 30, 1–41. [Google Scholar] [CrossRef]
  68. Jin, W.; He, Z.; Peng, T. A JIT part supply scheduling strategy with electric transport device between central receiving store and supermarkets in the automobile industry considering energy. eTransportation 2021, 9, 100126. [Google Scholar] [CrossRef]
  69. Divsalar, G.; Divsalar, A.; Jabbarzadeh, A.; Sahebi, H. An optimization approach for green tourist trip design. Soft Comput. 2022, 26, 4303–4332. [Google Scholar] [CrossRef]
  70. Delgado-Antequera, L.; Caballero, R.; Sánchez-Oro, J.; Colmenar, J.M.; Martí, R. Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Syst. Appl. 2020, 145, 113101. [Google Scholar] [CrossRef]
  71. Yazdekhasti, A.; Jazi, M.A.; Ma, J. Electric vehicle charging station location determination with consideration of routing selection policies and driver’s risk preference. Comput. Ind. Eng. 2021, 162, 107674. [Google Scholar] [CrossRef]
  72. Lu, C.; Gao, L.; Pan, Q.; Li, X.; Zheng, J. A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution. Appl. Soft Comput. 2019, 75, 728–749. [Google Scholar] [CrossRef]
  73. Jin, L.; Zhang, C.; Fei, X. Realizing energy savings in integrated process planning and scheduling. Processes 2019, 7, 120. [Google Scholar] [CrossRef]
  74. Gong, G.; Chiong, R.; Deng, Q.; Han, W.; Zhang, L.; Lin, W.; Li, K. Energy-efficient flexible flow shop scheduling with worker flexibility. Expert Syst. Appl. 2020, 141, 112902. [Google Scholar] [CrossRef]
  75. Song, C. A Hybrid Multi-Objective Teaching-Learning Based Optimization for Scheduling Problem of Hybrid Flow Shop with Unrelated Parallel Machine. IEEE Access 2021, 9, 56822–56835. [Google Scholar] [CrossRef]
  76. Zeng, Z.; Chen, X.; Wang, K. Energy Saving for Tissue Paper Mills by Energy-Efficiency Scheduling under Time-of-Use Electricity Tariffs. Processes 2021, 9, 274. [Google Scholar] [CrossRef]
  77. Wang, Y.; Peng, W.; Lu, C.; Xia, H. A Multi-Objective Cellular Memetic Optimization Algorithm for Green Scheduling in Flexible Job Shops. Symmetry 2022, 14, 832. [Google Scholar] [CrossRef]
  78. Sang, Y.; Tan, J. Many-Objective Flexible Job Shop Scheduling Problem with Green Consideration. Energies 2022, 15, 1884. [Google Scholar] [CrossRef]
  79. Zhang, W.; Geng, H.; Li, C.; Gen, M.; Zhang, G.; Deng, M. Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem. J. Intell. Manuf. 2023. [Google Scholar] [CrossRef]
  80. Li, Y.; Hu, R.; Wu, X.; Qian, B.; Zhang, Z.Q. Learning Variable Neighborhood Search Algorithm for Solving the Energy-Efficient Flexible Job-Shop Scheduling Problem; Springer Nature: Singapore, 2023; pp. 241–250. [Google Scholar] [CrossRef]
  81. Li, P.; Xue, Q.; Zhang, Z.; Chen, J.; Zhou, D. Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II. Comput. Oper. Res. 2023, 159, 106360. [Google Scholar] [CrossRef]
  82. Destouet, C.; Tlahig, H.; Bettayeb, B.; Mazari, B. Multi-objective sustainable flexible job shop scheduling problem: Balancing economic, ecological, and social criteria. Comput. Ind. Eng. 2024, 195, 110419. [Google Scholar] [CrossRef]
  83. Hassanzadeh, A.; Rasti-Barzoki, M. Minimizing total resource consumption and total tardiness penalty in a resource allocation supply chain scheduling and vehicle routing problem. Appl. Soft Comput. 2017, 58, 307–323. [Google Scholar] [CrossRef]
  84. Devika, K.; Jafarian, A.; Nourbakhsh, V. Designing a sustainable closed-loop supply chain network based on triple bottom line approach: A comparison of metaheuristics hybridization techniques. Eur. J. Oper. Res. 2014, 235, 594–615. [Google Scholar] [CrossRef]
  85. Iliopoulou, C.; Tassopoulos, I.X.; Kepaptsoglou, K. Multi-objective planning of electric bus systems in cities with trolleybus infrastructure networks. Sustain. Cities Soc. 2024, 103, 105227. [Google Scholar] [CrossRef]
  86. Ren, X.; Huang, H.; Feng, S.; Liang, G. An improved variable neighborhood search for bi-objective mixed-energy fleet vehicle routing problem. J. Clean. Prod. 2020, 275, 124155. [Google Scholar] [CrossRef]
  87. Irawan, C.A.; Jones, D.; Ouelhadj, D. Bi-objective optimisation model for installation scheduling in offshore wind farms. Comput. Oper. Res. 2017, 78, 393–407. [Google Scholar] [CrossRef]
  88. Irawan, C.A.; Abdulrahman, M.D.A.; Salhi, S.; Luis, M. An efficient matheuristic algorithm for bi-objective sustainable closed-loop supply chain networks. IMA J. Manag. Math. 2022, 33, 603–636. [Google Scholar] [CrossRef]
  89. Chargui, T.; Bekrar, A.; Reghioui, M.; Trentesaux, D. Multi-objective sustainable truck scheduling in a rail-road physical internet cross-docking hub considering energy consumption. Sustainability 2019, 11, 3127. [Google Scholar] [CrossRef]
  90. Cao, L.; Ye, C.; Cheng, R.; Wang, Z. Memory-based variable neighborhood search for green vehicle routing problem with passing-by drivers: A comprehensive perspective. Complex Intell. Syst. 2022, 8, 2507–2525. [Google Scholar] [CrossRef] [PubMed]
  91. Zhang, S.; Chen, M.; Zhang, W. A novel location-routing problem in electric vehicle transportation with stochastic demands. J. Clean. Prod. 2019, 221, 567–581. [Google Scholar] [CrossRef]
  92. Araghi, M.E.T.; Tavakkoli-Moghaddam, R.; Jolai, F.; Molana, S.M.H. A green multi-facilities open location-routing problem with planar facility locations and uncertain customer. J. Clean. Prod. 2021, 282, 124343. [Google Scholar] [CrossRef]
  93. Hu, Z.H.; Sheu, J.B.; Zhao, L.; Lu, C.C. A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods. Transp. Res. Part C Emerg. Technol. 2015, 55, 273–297. [Google Scholar] [CrossRef]
  94. Qi, M.; Xiong, W.; Zhou, Q.; Hua, S. Robust Periodic Vehicle Routing Problem with Service Time Uncertainty. In Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bangkok, Thailand, 16–19 December 2018; IEEE: Piscataway, NJ, USA, 2018; pp. 1431–1435. [Google Scholar] [CrossRef]
  95. Jeong, J.; Ghaddar, B.; Zufferey, N.; Nathwani, J. Adaptive robust electric vehicle routing under energy consumption uncertainty. Transp. Res. Part C Emerg. Technol. 2024, 160, 104529. [Google Scholar] [CrossRef]
  96. Gruler, A.; Quintero-Araújo, C.L.; Calvet, L.; Juan, A.A. Waste collection under uncertainty: A simheuristic based on variable neighbourhood search. Eur. J. Ind. Eng. 2017, 11, 228–255. [Google Scholar] [CrossRef]
  97. Lu, J.; Wang, L. A Bi-Strategy Based Optimization Algorithm for the Dynamic Capacitated Electric Vehicle Routing Problem. In Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand, 10–13 June 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 646–653. [Google Scholar] [CrossRef]
  98. Kong, M.; Xu, J.; Zhang, T.; Lu, S.; Fang, C.; Mladenovic, N. Energy-efficient rescheduling with time-of-use energy cost: Application of variable neighborhood search algorithm. Comput. Ind. Eng. 2021, 156, 107286. [Google Scholar] [CrossRef]
  99. Koháni, M.; Babčan, S. Variable Neighborhood Search for the Electric Bus Charging Stations Location Design Problem. In Proceedings of the 13th International Conference on Operations Research and Enterprise Systems. SCITEPRESS-Science and Technology Publications, Rome, Italy, 24–26 February 2024; pp. 317–324. [Google Scholar] [CrossRef]
  100. Fard, A.M.F.; Hajaghaei-Keshteli, M. A tri-level location-allocation model for forward/reverse supply chain. Appl. Soft Comput. 2018, 62, 328–346. [Google Scholar] [CrossRef]
  101. Cintrano, C.; Toutouh, J.; Alba, E. Citizen Centric Optimal Electric Vehicle Charging Stations Locations in a Full City: Case of Malaga; Springer: Cham, Switzerland, 2021; pp. 247–257. [Google Scholar] [CrossRef]
  102. Li, D.; Zheng, T.; Li, J.; Teymourifar, A. A Hybrid Framework Integrating Machine-learning and Mathematical Programming Approaches for Sustainable Scheduling of Flexible Job-shop Problems. Chem. Eng. Trans. 2023, 103, 385–390. [Google Scholar] [CrossRef]
  103. Xiao, Q.; Gao, J. The Multi-Visit Vehicle Routing Problem with Drones under Carbon Trading Mechanism. Sustainability 2024, 16, 6145. [Google Scholar] [CrossRef]
  104. Chen, W.; Zhang, D.; Woensel, T.V.; Xu, G.; Guo, J. Green vehicle routing using mixed fleets for cold chain distribution. Expert Syst. Appl. 2023, 233, 120979. [Google Scholar] [CrossRef]
  105. Bac, U.; Erdem, M. Optimization of electric vehicle recharge schedule and routing problem with time windows and partial recharge: A comparative study for an urban logistics fleet. Sustain. Cities Soc. 2021, 70, 102883. [Google Scholar] [CrossRef]
  106. Matijević, L. General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows. Int. J. Ind. Eng. Comput. 2023, 14, 275–292. [Google Scholar] [CrossRef]
  107. Su, Y.; Zhang, S.; Zhang, C. A lightweight genetic algorithm with variable neighborhood search for multi-depot vehicle routing problem with time windows. Appl. Soft Comput. 2024, 161, 111789. [Google Scholar] [CrossRef]
  108. 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. In Annals of Mathematics and Artificial Intelligence; Springer: Berlin/Heidelberg, Germany, 2023. [Google Scholar] [CrossRef]
  109. Stamadianos, T.; Kyriakakis, N.A.; Marinaki, M.; Marinakis, Y. The close-open mixed-fleet electric vehicle routing problem. Clean. Logist. Supply Chain 2023, 9, 100125. [Google Scholar] [CrossRef]
  110. Shojaei, M.; Fakhrmoosavi, F.; Zockaie, A.; Ghamami, M.; Mittal, A.; Fishelson, J. Sustainable Transportation Networks Incorporating Green Modes for Urban Freight Delivery. J. Transp. Eng. Part A Syst. 2022, 148, 6. [Google Scholar] [CrossRef]
  111. Todosijević, R.; Urošević, D.; Mladenović, N.; Brimberg, J. Less Is More Approach. In Discrete Diversity and Dispersion Maximization: A Tutorial on Metaheuristic Optimization; Springer: Cham, Switzerland, 2023; pp. 191–220. [Google Scholar]
  112. Biesinger, B.; Hu, B.; Stubenschrott, M.; Ritzinger, U.; Prandtstetter, M. Optimizing Charging Station Locations for Electric Car-Sharing Systems; Springer International Publishing: Cham, Switzerland, 2017; Volume 10197, pp. 157–172. [Google Scholar] [CrossRef]
  113. Almouhanna, A.; Quintero-Araujo, C.L.; Panadero, J.; Juan, A.A.; Khosravi, B.; Ouelhadj, D. The location routing problem using electric vehicles with constrained distance. Comput. Oper. Res. 2020, 115, 104864. [Google Scholar] [CrossRef]
  114. Cao, J.X.; Wang, X.; Gao, J. A two-echelon location-routing problem for biomass logistics systems. Biosyst. Eng. 2021, 202, 106–118. [Google Scholar] [CrossRef]
  115. Corrêa, V.H.V.; dos Santos, A.G.; Nogueira, T.H. Strategies for Electric Location-routing Problems Considering Short and Long Term Horizons. In Proceedings of the International Conference on Enterprise Information Systems, ICEIS-Proceedings, Virtual, 26–28 April 2021; Science and Technology Publications, Lda: Setubal, Portugal, 2021; Volume 1, pp. 795–802. [Google Scholar] [CrossRef]
  116. Stumpe, M.; Rößler, D.; Schryen, G.; Kliewer, N. Study on sensitivity of electric bus systems under simultaneous optimization of charging infrastructure and vehicle schedules. EURO J. Transp. Logist. 2021, 10, 100049. [Google Scholar] [CrossRef]
  117. Karakostas, P.; Sifaleras, A.; Georgiadis, M.C. Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. Optim. Lett. 2022, 16, 211–235. [Google Scholar] [CrossRef]
  118. Hu, W.; Dong, J.; Xu, N. Multi-period planning of integrated underground logistics system network for automated construction-demolition-municipal waste collection and parcel delivery: A case study. J. Clean. Prod. 2022, 330, 129760. [Google Scholar] [CrossRef]
  119. Olsen, N.; Kliewer, N. Location Planning of Charging Stations for Electric Buses in Public Transport Considering Vehicle Scheduling: A Variable Neighborhood Search Based Approach. Appl. Sci. 2022, 12, 3855. [Google Scholar] [CrossRef]
  120. Vukićević, M.; Ratli, M.; Rivenq, A.; Zrikem, M. Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach. Comput. Oper. Res. 2023, 157, 106263. [Google Scholar] [CrossRef]
  121. Irawan, C.A.; Salhi, S.; Chan, H.K. A continuous location and maintenance routing problem for offshore wind farms: Mathematical models and hybrid methods. Comput. Oper. Res. 2022, 144, 105825. [Google Scholar] [CrossRef]
  122. Irawan, C.A.; Starita, S.; Chan, H.K.; Eskandarpour, M.; Reihaneh, M. Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat. Eur. J. Oper. Res. 2023, 307, 328–350. [Google Scholar] [CrossRef]
  123. Gläser, S.; Stücken, M. Introduction of an underground waste container system–model and solution approaches. Eur. J. Oper. Res. 2021, 295, 675–689. [Google Scholar] [CrossRef]
  124. Innis, C.; Chen, P. Location-Routing Problem for Electric Delivery Vehicles with Mobile Charging Trailers. In Proceedings of the 2024 American Control Conference (ACC), Toronto, ON, Canada, 10–12 July 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 3007–3012. [Google Scholar] [CrossRef]
  125. Noreña-Zapata, D.; Restrepo-Vallejo, J.C.; Morillo-Torres, D.; Gatica, G. A Novel Exact and Heuristic Solution for the Periodic Location-Routing Problem Applied to Waste Collection. Processes 2024, 12, 1557. [Google Scholar] [CrossRef]
  126. Zhou, Y.; Liret, A.; Liu, J.; Ferreyra, E.; Rana, R.; Kern, M. Decision Support System for Green Real-Life Field Scheduling Problems; Springer: Cham, Switzerland, 2017; pp. 355–369. [Google Scholar] [CrossRef]
  127. Luan, F.; Cai, Z.; Wu, S.; Liu, S.Q.; He, Y. Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm. Mathematics 2019, 7, 688. [Google Scholar] [CrossRef]
  128. Jiang, T.; Zhang, C.; Sun, Q.M. Green Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm. IEEE Access 2019, 7, 43153–43166. [Google Scholar] [CrossRef]
  129. Kong, M.; Pei, J.; Liu, X.; Lai, P.C.; Pardalos, P.M. Green manufacturing: Order acceptance and scheduling subject to the budgets of energy consumption and machine launch. J. Clean. Prod. 2020, 248, 119300. [Google Scholar] [CrossRef]
  130. Gu, J.; Jiang, T.; Zhu, H.; Zhang, C. Low-Carbon Job Shop Scheduling Problem with Discrete Genetic-Grey Wolf Optimization Algorithm. J. Adv. Manuf. Syst. 2020, 19, 1–14. [Google Scholar] [CrossRef]
  131. Zhu, S.; Gao, J.; He, X.; Zhang, S.; Jin, Y.; Tan, Z. Green logistics oriented tug scheduling for inland waterway logistics. Adv. Eng. Inform. 2021, 49, 101323. [Google Scholar] [CrossRef]
  132. Varga, J.; Raidl, G.R.; Limmer, S. Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access 2022, 10, 105786–105806. [Google Scholar] [CrossRef]
  133. Li, H.; Wang, S.; Zhen, L.; Wang, X. Data-driven optimization for automated warehouse operations decarbonization. Ann. Oper. Res. 2022, 343, 1129–1156. [Google Scholar] [CrossRef]
  134. Luan, F.; Li, R.; Liu, S.Q.; Tang, B.; Li, S.; Masoud, M. An Improved Sparrow Search Algorithm for Solving the Energy-Saving Flexible Job Shop Scheduling Problem. Machines 2022, 10, 847. [Google Scholar] [CrossRef]
  135. Fan, H.; Yu, J.; Liu, X. Tramp ship routing and scheduling with speed optimization considering carbon emissions. Sustainability 2019, 11, 6367. [Google Scholar] [CrossRef]
  136. Erdem, M. The multi-period electric home healthcare routeing and scheduling problem with nonlinear charging. S. Afr. J. Ind. Eng. 2020, 31, 92–106. [Google Scholar] [CrossRef]
  137. De, A.; Wang, J.; Tiwari, M.K. Fuel Bunker Management Strategies within Sustainable Container Shipping Operation Considering Disruption and Recovery Policies. IEEE Trans. Eng. Manag. 2021, 68, 1089–1111. [Google Scholar] [CrossRef]
  138. Yin, Y.; Liu, X.; Chu, F.; Wang, D. An exact algorithm for the home health care routing and scheduling with electric vehicles and synergistic-transport mode. Ann. Oper. Res. 2023. [Google Scholar] [CrossRef]
  139. Zhou, S.; Zhang, D.; Ji, B.; Zhou, S.; Li, S.; Zhou, L. A MILP model and heuristic method for the time-dependent electric vehicle routing and scheduling problem with time windows. J. Clean. Prod. 2024, 434, 140188. [Google Scholar] [CrossRef]
  140. Amini, H.; Kianfar, K. A variable neighborhood search based algorithm and game theory models for green supply chain design. Appl. Soft Comput. 2022, 119, 108615. [Google Scholar] [CrossRef]
  141. Jahed, A.; Molana, S.M.H.; Tavakkoli-Moghaddam, R.; Valizadeh, V. Designing an integrated sustainable-resilient mix-and-match vaccine supply chain network. Ann. Oper. Res. 2024. [Google Scholar] [CrossRef]
  142. Pia, A.D.; Filippi, C. A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int. Trans. Oper. Res. 2006, 13, 125–141. [Google Scholar] [CrossRef]
  143. Benjamin, A.M.; Beasley, J.E. Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 2010, 37, 2270–2280. [Google Scholar] [CrossRef]
  144. Hemmelmayr, V.; Doerner, K.F.; Hartl, R.F.; Rath, S. A heuristic solution method for node routing based solid waste collection problems. J. Heuristics 2013, 19, 129–156. [Google Scholar] [CrossRef]
  145. Hemmelmayr, V.C.; Doerner, K.F.; Hartl, R.F.; Vigo, D. Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management. Transp. Sci. 2014, 48, 103–120. [Google Scholar] [CrossRef]
  146. Schneider, M.; Stenger, A.; Goeke, D. The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 2014, 48, 500–520. [Google Scholar] [CrossRef]
  147. Henke, T.; Speranza, M.G.; Wäscher, G. The multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 2015, 246, 730–743. [Google Scholar] [CrossRef]
  148. Djikanovic, J.; Joksimovic, D.; Vujosevic, M. Application of Variable Neighbourhood Search Method for Vehicle-Routing Problems in an Integrated Forward and Reverse Logistic Chain. Acta Polytech. Hung. 2015, 12, 51–70. [Google Scholar]
  149. Roberti, R.; Wen, M. The Electric Traveling Salesman Problem with Time Windows. Transp. Res. Part E Logist. Transp. Rev. 2016, 89, 32–52. [Google Scholar] [CrossRef]
  150. Bruglieri, M.; Mancini, S.; Pezzella, F.; Pisacane, O.; Suraci, S. A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges. Electron. Notes Discret. Math. 2017, 58, 95–102. [Google Scholar] [CrossRef]
  151. Affi, M.; Derbel, H.; Jarboui, B. Variable neighborhood search algorithm for the green vehicle routing problem. Int. J. Ind. Eng. Comput. 2018, 9, 195–204. [Google Scholar] [CrossRef]
  152. Tayachi, D.; Boukadi, H. A variable neighborhood search to reduce carbon dioxide emissions in the capacitated vehicle routing problem. In Proceedings of the 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), Paris, France, 23–26 April 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 297–301. [Google Scholar] [CrossRef]
  153. Rezgui, D.; Siala, J.C.; Aggoune-Mtalaa, W.; Bouziri, H. Application of a variable neighborhood search algorithm to a fleet size and mix vehicle routing problem with electric modular vehicles. Comput. Ind. Eng. 2019, 130, 537–550. [Google Scholar] [CrossRef]
  154. Li, L.; Li, T.; Wang, K.; Gao, S.; Chen, Z.; Wang, L. Heterogeneous fleet electric vehicle routing optimization for logistic distribution with time windows and simultaneous pick-up and delivery service. In Proceedings of the 2019 16th International Conference on Service Systems and Service Management (ICSSSM), Shenzhen, China, 13–15 July 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 1–6. [Google Scholar] [CrossRef]
  155. Peng, B.; Wu, L.; Yi, Y.; Chen, X. Solving the multi-depot green vehicle routing problem by a hybrid evolutionary algorithm. Sustainability 2020, 12, 2127. [Google Scholar] [CrossRef]
  156. Shao, S.; Xu, S.X.; Huang, G.Q. Variable neighborhood search and tabu search for auction-based waste collection synchronization. Transp. Res. Part B Methodol. 2020, 133, 1–20. [Google Scholar] [CrossRef]
  157. De, A.; Wang, J.; Tiwari, M.K. Hybridizing basic variable neighborhood search with particle swarm optimization for solving sustainable ship routing and bunker management problem. IEEE Trans. Intell. Transp. Syst. 2020, 21, 986–997. [Google Scholar] [CrossRef]
  158. Zhu, X.; Yan, R.; Huang, Z.; Wei, W.; Yang, J.; Kudratova, S. Logistic Optimization for Multi Depots Loading Capacitated Electric Vehicle Routing Problem from Low Carbon Perspective. IEEE Access 2020, 8, 31934–31947. [Google Scholar] [CrossRef]
  159. Lu, J.; Chen, Y.; Hao, J.K.; He, R. The Time-dependent Electric Vehicle Routing Problem: Model and solution. Expert Syst. Appl. 2020, 161, 113593. [Google Scholar] [CrossRef]
  160. Wang, L.; Gao, S.; Wang, K.; Li, T.; Li, L.; Chen, Z. Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility. J. Adv. Transp. 2020, 2020, 1DUMMMY. [Google Scholar] [CrossRef]
  161. Sadati, M.E.H.; Çatay, B. A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 2021, 149, 102293. [Google Scholar] [CrossRef]
  162. Fan, H.; Zhang, Y.; Tian, P.; Lv, Y.; Fan, H. Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance. Comput. Oper. Res. 2021, 129, 105211. [Google Scholar] [CrossRef]
  163. Islam, M.A.; Gajpal, Y. Optimization of conventional and green vehicles composition under carbon emission cap. Sustainability 2021, 13, 6940. [Google Scholar] [CrossRef]
  164. Zhao, W.; Zhang, R.; Yuan, X.; Luo, K. An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries. In Proceedings of the 2021 11th International Conference on Information Science and Technology, ICIST 2021, Chengdu, China, 21–23 May 2021; IEEE: Piscataway, NJ, USA, 2021; pp. 659–667. [Google Scholar] [CrossRef]
  165. Wang, D.; Zhou, H. A two-echelon electric vehicle routing problem with time windows and battery swapping stations. Appl. Sci. 2021, 11, 10779. [Google Scholar] [CrossRef]
  166. Lin, B.; Ghaddar, B.; Nathwani, J. Electric vehicle routing with charging/discharging under time-variant electricity prices. Transp. Res. Part C Emerg. Technol. 2021, 130, 103285. [Google Scholar] [CrossRef]
  167. Zhou, Y.; Huang, J.; Shi, J.; Wang, R.; Huang, K. The electric vehicle routing problem with partial recharge and vehicle recycling. Complex Intell. Syst. 2021, 7, 1445–1458. [Google Scholar] [CrossRef]
  168. Jabir, E.; Panicker, V.V.; Sridharan, R. Environmental friendly route design for a milk collection problem: The case of an Indian dairy. Int. J. Prod. Res. 2022, 60, 912–941. [Google Scholar] [CrossRef]
  169. Roy, A.; Manna, A.; Kim, J.; Moon, I. IoT-based smart bin allocation and vehicle routing in solid waste management: A case study in South Korea. Comput. Ind. Eng. 2022, 171, 108457. [Google Scholar] [CrossRef]
  170. Sadati, M.E.H.; Akbari, V.; Çatay, B. Electric vehicle routing problem with flexible deliveries. Int. J. Prod. Res. 2022, 60, 4268–4294. [Google Scholar] [CrossRef]
  171. Kyriakakis, N.A.; Stamadianos, T.; Marinaki, M.; Marinakis, Y. The electric vehicle routing problem with drones: An energy minimization approach for aerial deliveries. Clean. Logist. Supply Chain 2022, 4, 100041. [Google Scholar] [CrossRef]
  172. Yilmaz, Y.; Kalayci, C.B. Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery. Mathematics 2022, 10, 3108. [Google Scholar] [CrossRef]
  173. Akbay, M.A.; Kalayci, C.B.; Blum, C.; Polat, O. Variable Neighborhood Search for the Two-Echelon Electric Vehicle Routing Problem with Time Windows. Appl. Sci. 2022, 12, 1014. [Google Scholar] [CrossRef]
  174. Zhao, T.; Lu, S.; Kong, M.; Cheng, H.; Liu, X. Green scheduling of packaging in the global logistics distribution centre with a dominant job and deterioration effects. Int. J. Logist. Res. Appl. 2025, 28, 98–120. [Google Scholar] [CrossRef]
  175. Thumrongvut, P.; Sethanan, K.; Pitakaso, R.; Jamrus, T.; Golinska-Dawson, P. Application of Industry 3.5 approach for planning of more sustainable supply chain operations for tourism service providers. Int. J. Logist. Res. Appl. 2023, 26, 1578–1601. [Google Scholar] [CrossRef]
  176. Kyriakakis, N.A.; Aronis, S.; Marinaki, M.; Marinakis, Y. A GRASP/VND algorithm for the energy minimizing drone routing problem with pickups and deliveries. Comput. Ind. Eng. 2023, 182, 109340. [Google Scholar] [CrossRef]
  177. Yanpirat, N.; Silva, D.F.; Smith, A.E. Sustainable last mile parcel delivery and return service using drones. Eng. Appl. Artif. Intell. 2023, 124, 106631. [Google Scholar] [CrossRef]
  178. Li, Y.; Sun, Z. Repositioning shared bikes under low-carbon policies. Comput. Ind. Eng. 2023, 184, 109594. [Google Scholar] [CrossRef]
  179. Euchi, J.; Yassine, A. A hybrid metaheuristic algorithm to solve the electric vehicle routing problem with battery recharging stations for sustainable environmental and energy optimization. Energy Syst. 2023, 14, 243–267. [Google Scholar] [CrossRef]
  180. Moradi, N.; Sadat, İ.; Çatay, B. Last mile delivery routing problem using autonomous electric vehicles. Comput. Ind. Eng. 2023, 184, 109552. [Google Scholar] [CrossRef]
  181. Li, K.; Li, D.; Ma, H.Q. An improved discrete particle swarm optimization approach for a multi-objective optimization model of an urban logistics distribution network considering traffic congestion. Adv. Prod. Eng. Manag. 2023, 18, 211–224. [Google Scholar] [CrossRef]
  182. Lou, P.; Zhou, Z.; Zeng, Y.; Fan, C. Vehicle routing problem with time windows and carbon emissions: A case study in logistics distribution. Environ. Sci. Pollut. Res. 2024, 31, 41600–41620. [Google Scholar] [CrossRef]
  183. Ferreira, K.M.; de Queiroz, T.A.; Munari, P.; Toledo, F.M.B. A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Eur. J. Oper. Res. 2024, 316, 597–616. [Google Scholar] [CrossRef]
  184. Zhu, T.; Boyles, S.D.; Unnikrishnan, A. Battery Electric Vehicle Traveling Salesman Problem with Drone. Networks Spat. Econ. 2024, 24, 49–97. [Google Scholar] [CrossRef]
  185. Fazeli, S.S.; Venkatachalam, S.; Smereka, J.M. Efficient algorithms for electric vehicles’ min-max routing problem. Sustain. Oper. Comput. 2024, 5, 15–28. [Google Scholar] [CrossRef]
  186. Souza, A.L.; Papini, M.; Penna, P.H.; Souza, M.J. A flexible variable neighbourhood search algorithm for different variants of the Electric Vehicle Routing Problem. Comput. Oper. Res. 2024, 168, 106713. [Google Scholar] [CrossRef]
  187. Wang, H.; Chen, S.; Li, M.; Zhu, C.; Wang, Z. Demand-Driven Charging Strategy Based Distributed Routing Optimization Under Traffic Restrictions in Internet of Electric Vehicles. IEEE Internet Things J. 2024, 11, 35917–35927. [Google Scholar] [CrossRef]
  188. Masmoudi, M.A.; Baldacci, R.; Mancini, S.; Kuo, Y.H. Multi-compartment waste collection vehicle routing problem with bin washer. Transp. Res. Part E Logist. Transp. Rev. 2024, 189, 103681. [Google Scholar] [CrossRef]
  189. Rojas-Saavedra, J.E.; Álvarez Martínez, D.; Escobar, J.W. Boosting sustainable development goals: A hybrid metaheuristic approach for the heterogeneous vehicle routing problem with three-dimensional packing constraints and fuel consumption. Ann. Oper. Res. 2023. [Google Scholar] [CrossRef]
  190. Yin, P.Y.; Wang, T.Y. A GRASP-VNS algorithm for optimal wind-turbine placement in wind farms. Renew. Energy 2012, 48, 489–498. [Google Scholar] [CrossRef]
  191. Zolfagharinia, H.; Hafezi, M.; Farahani, R.Z.; Fahimnia, B. A hybrid two-stock inventory control model for a reverse supply chain. Transp. Res. Part E Logist. Transp. Rev. 2014, 67, 141–161. [Google Scholar] [CrossRef]
  192. Sifaleras, A.; Konstantaras, I. General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain. Electron. Notes Discret. Math. 2015, 47, 69–76. [Google Scholar] [CrossRef]
  193. Sifaleras, A.; Konstantaras, I.; Mladenović, N. Variable neighborhood search for the economic lot sizing problem with product returns and recovery. Int. J. Prod. Econ. 2015, 160, 133–143. [Google Scholar] [CrossRef]
  194. Sifaleras, A.; Konstantaras, I. Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems. Comput. Oper. Res. 2017, 78, 385–392. [Google Scholar] [CrossRef]
  195. Irawan, C.A.; Song, X.; Jones, D.; Akbari, N. Layout optimisation for an installation port of an offshore wind farm. Eur. J. Oper. Res. 2017, 259, 67–83. [Google Scholar] [CrossRef]
  196. Cazzaro, D.; Pisinger, D. Variable neighborhood search for large offshore wind farm layout optimization. Comput. Oper. Res. 2022, 138, 105588. [Google Scholar] [CrossRef]
Figure 1. Number of publications per year.
Figure 1. Number of publications per year.
Algorithms 18 00038 g001
Figure 2. A cloud of concepts with the journals according to the papers.
Figure 2. A cloud of concepts with the journals according to the papers.
Algorithms 18 00038 g002
Figure 3. Number of publications per general decision problem.
Figure 3. Number of publications per general decision problem.
Algorithms 18 00038 g003
Figure 4. Distribution of publications per most common VNS versions.
Figure 4. Distribution of publications per most common VNS versions.
Algorithms 18 00038 g004
Figure 5. Methods combined with VNS to solve sustainable logistic problems.
Figure 5. Methods combined with VNS to solve sustainable logistic problems.
Algorithms 18 00038 g005
Figure 6. Distribution of studies according to the multiobjective approach.
Figure 6. Distribution of studies according to the multiobjective approach.
Algorithms 18 00038 g006
Figure 7. Number of publications per sustainability field.
Figure 7. Number of publications per sustainability field.
Algorithms 18 00038 g007
Table 1. Inclusion and exclusion criteria used to select papers.
Table 1. Inclusion and exclusion criteria used to select papers.
CriteriaJustification
InclusionPapers published between 2006 and August 2024To focus on the most recent publications.
Publications in peer-reviewed journals, conference papers and chaptersTo concentrate on high-quality articles and other documents for a broader and more comprehensive literature search.
The measure of environmental or social impact is explicit either in the objective function or in the constraints of the model, or comes implicitly due to the kind of vehicles used (electric, hybrid, ⋯)This criterion ensures that the research specifically addresses sustainability aspects, which is central to our study. By including models that consider environmental or social impacts, we can better evaluate the effectiveness and practicality of various logistics solutions in promoting sustainable practices. The focus on vehicle types further emphasizes the operational choices that contribute to reduced emissions and overall environmental benefits.
ExclusionStudies in a language other than EnglishEnglish is the predominant language of scientific research, ensuring a wider scope of high-quality and peer-reviewed papers. Additionally, limiting the review to English-language papers facilitates consistent and accurate analysis by all researchers involved.
Table 2. Ways to include adaptability in AVNS.
Table 2. Ways to include adaptability in AVNS.
PaperShakeImproveSelectOrderHybridBest/First
[27]----X-
[28]----X-
[19]XXX---
[14]-XXX--
[20]-XXX--
[29]----X-
[31]-XXX-X
[23]XX----
[24]XX----
[15]X--X--
[21]X--X--
[25]X--X--
[22]XX-X--
[16]X-X---
[30]-XX-X-
[17]X--X--
[18]X-XX--
[26]----X-
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.

Share and Cite

MDPI and ACS Style

de Armas, J.; Moreno-Pérez, J.A. A Survey on Variable Neighborhood Search for Sustainable Logistics. Algorithms 2025, 18, 38. https://doi.org/10.3390/a18010038

AMA Style

de Armas J, Moreno-Pérez JA. A Survey on Variable Neighborhood Search for Sustainable Logistics. Algorithms. 2025; 18(1):38. https://doi.org/10.3390/a18010038

Chicago/Turabian Style

de Armas, Jesica, and José A. Moreno-Pérez. 2025. "A Survey on Variable Neighborhood Search for Sustainable Logistics" Algorithms 18, no. 1: 38. https://doi.org/10.3390/a18010038

APA Style

de Armas, J., & Moreno-Pérez, J. A. (2025). A Survey on Variable Neighborhood Search for Sustainable Logistics. Algorithms, 18(1), 38. https://doi.org/10.3390/a18010038

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop