Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery

Majidi, Setareh; Hosseini‐Motlagh, Seyyed‐Mahdi; Ignatius, Joshua

doi:10.1007/s00500-017-2535-5

Cited by 35 publications

(12 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [76], the selection probabilities look completely di erent for two runs of the ALNS on the same instance, and the authors therefore conclude that the current weight adjustment formula is far from optimal. Additionally, the success percentages (the number of times the new best, or a better solution was found) of the most frequently used heuristics are not necessarily the highest [30,76,78]. This e ect can be explained by the fact that some heuristics tend to have success in the earlier iterations of the algorithm, thus increasing the weight and the probability to be selected for further iterations in which they might be far less successful.…”

Section: Discussionmentioning

confidence: 99%

“…There are many more papers which do not explicitly evaluate the importance of the adaptive layer, but which do investigate the performance of di erent destroy and repair heuristics. The nal probabilities of choosing di erent heuristics, averaged across instances, were shown to be (more or less) di erent in [14,23,27,74,76,78]. According to the authors, signi cant variations between the min and max nal selection probabilities in the case of some heuristics in [23] suggest the importance of the adaptation layer.…”

Section: Justification For Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Turkeš

Sörensen

Hvattum

2021

European Journal of Operational Research

View full text Add to dashboard Cite

Research on metaheuristics has focused almost exclusively on (novel) algorithmic development and on competitive testing, both of which have been frequently argued to yield very little generalizable knowledge. The main goal of this paper is to promote meta-analysis-a systematic statistical examination that combines the results of several independent studies-as a more suitable way to obtain problem-and implementation-independent insights on metaheuristics. Meta-analysis is widely used in several scienti c domains, most notably the medical sciences (e.g., to establish the e cacy of a certain treatment). To the best of our knowledge this is the rst meta-analysis in the eld of metaheuristics.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Justification For Reviewmentioning

confidence: 99%

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Turkeš

Sörensen

Hvattum

2021

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Therefore, the route deletion stage is added to the local search process. In contrast to the original p-SA algorithm, which selects each local search method with the same probability, we split the local search process into two stages, the revised route deletion stage and the classical local search stage, which is based on the research of [41]. FIGURE 4 shows the framework of the local search with the route deletion stage.…”

Section: Local Search With Route Deletion Stagementioning

confidence: 99%

A Solution for the Full-Load Collection Vehicle Routing Problem With Multiple Trips and Demands: An Application in Beijing

Zhang

Wang

2020

IEEE Access

View full text Add to dashboard Cite

Municipal solid waste (MSW) collection has become a major challenge for clean city management and social sustainable development in developing economies. A new variant of the collection vehicle routing problem (CVRP) is addressed with the characteristics of full loads and multiple trips of the collection vehicles, and multiple demands of the garbage facilities, which is called the collection vehicle routing problem of the garbage facilities (CVRPGF) in this study. Dummy customers are introduced to equivalently transform the CVRPGF problem to the vehicle routing problem with simultaneous pickupdelivery and time windows (VRPSPDTW). A parallel simulated annealing algorithm (Par-SAA) is developed to solve the VRPSPDTW problem. When applied to an international benchmark dataset, the computational results prove the superiority of the proposed algorithm, in which the number of collection vehicles (NV) in four instances is reduced by one. Finally, when the model and algorithm are applied to a real CVRPGF problem in the Xuanwu District of Beijing, the NV needed is reduced by 30%, and the total travel time is decreased by 12%. Thus, the effectiveness of the Par-SAA is demonstrated, and the proposed solution has practical value in China. INDEX TERMS Municipal solid waste collection, vehicle routing, full load, multiple trips, multiple demands, dummy customer, parallel simulated annealing.

show abstract

“…The fleet is transferring 22 quantity of commodities just departing from buyer 21, being less than its volume. Another category of limitation (24)(25)(26)(27)(28)(29)(30)(31) as shipping ones act appropriately prevents sub-tours to occur.…”

Section: A Case Study and Sensitivity Analysismentioning

confidence: 99%

“…A VRPSPD model alongside with non-homogeneous vehicles was introduced by Avci and Topaloglu [26] solved with metaheuristic algorithm. In another study, Hosseini-Motlagh and et al [27] showed a pollution routing problem is discussed using simultaneous pickup and delivery. The authors declared the aims of this issue minimized the fuel and emissions consumption as well as using scheduling and routing customers.…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

A new bi-objective integrated vehicle transportation model considering simultaneous pick-up and split delivery

2020

View full text Add to dashboard Cite

Nowadays, global competition causes that the companies are dealing with the issue of cost reduction besides increasing productivity in business network more than ever. Because of that, today, both industrial practitioners and researchers are focusing on the supply chain structure issues. In order to achieve the real word objectives, the aim of the paper is to improve the performance of the supply chain network via not only taking into account simultaneous pickup and split delivery but also minimizing the total costs as well as maximizing customer services alongside multi-period and multiproducts. Besides, to accumulate the data of parameters, a food industry is considered for a case study which is in the north of Iran. Eventually, the proposed mixed-integer linear programming model is addressed by a ε-constraint method. Finally, related results of this solution are analyzed and also is compared with simple vehicle routing problem (VRP).

show abstract

Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery

Cited by 35 publications

References 20 publications

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

A Solution for the Full-Load Collection Vehicle Routing Problem With Multiple Trips and Demands: An Application in Beijing

A new bi-objective integrated vehicle transportation model considering simultaneous pick-up and split delivery

Contact Info

Product

Resources

About