A Differential Evolution &amp; Genetic Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pick-up and Time Windows

Cao, Erbao; Lai, Mingyong; Nie, Kai

doi:10.3182/20080706-5-kr-1001.01791

Cited by 8 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A new parameter that serves as a central element in several studies is the determination of the logistic routes to be drawn. In this line, Erbao, Mingyong and Kai (2008), Achillas, Aidonis, Vlachokostas, Moussiopoulos, Banias and Triantafillou (2012) and Soysal (2016) offered three different models that aim to minimize logistical costs by deciding on routes to be drawn by the vehicles.…”

Section: Main Decisions Of Rl According To Mathematical Modelsmentioning

confidence: 99%

Identification of reverse logistics decision types from mathematical models

Pellicer

Valero

2018

JIEM

View full text Add to dashboard Cite

Purpose: The increase in social awareness, politics and environmental regulation, the scarcity of raw materials and the desired “green” image, are some of the reasons that lead companies to decide for implement processes of Reverse Logistics (RL). At the time when incorporate new RL processes as key business processes, new and important decisions need to be made. Identification and knowledge of these decisions, including the information available and the implications for the company or supply chain, will be fundamental for decision-makers to achieve the best results. In the present work, the main types of RL decisions are identified.Design/methodology/approach: This paper is based on the analysis of mathematical models designed as tools to aid decision making in the field of RL. Once the types of interest work to be analyzed are defined, those studies that really deal about the object of study are searched and analyzed. The decision variables that are taken at work are identified and grouped according to the type of decision and, finally, are showed the main types of decisions used in mathematical models developed in the field of RL. Findings: The principal conclusion of the research is that the most commonly addressed decisions with mathematical models in the field of RL are those related to the network’s configuration, followed by tactical/operative decisions such as the selections of product’s treatments to realize and the policy of returns or prices, among other decisions.Originality/value: The identification of the main decisions types of the reverse logistics will allow the managers of these processes to know and understand them better, while offer an integrated vision of them, favoring the achievement of better results.

show abstract

Section: Main Decisions Of Rl According To Mathematical Modelsmentioning

confidence: 99%

Identification of reverse logistics decision types from mathematical models

Pellicer

Valero

2018

JIEM

View full text Add to dashboard Cite

show abstract

“…Erbao ve ark. (2008) zaman penceresi ekleyerek problem çözümü için diferansiyel evrim algoritması ile genetik algoritmadan oluşan melez bir algoritma önermişlerdir [13]. Ai ve Kachitvichyanukul (2009) problem çözümü için kuş sürüsü en iyileme algoritması geliştirmişlerdir [14].…”

Section: Li̇teratür Araştirmasi (Literature Research)unclassified

“…Eş zamanlı topla-dağıt araç rotalama problemi ilk olarak 1989 yılında gerçek bir kütüphane sistemi ele alınarak Min (1989) [13]. Ai ve Kachitvichyanukul (2009) problem çözümü için kuş sürüsü en iyileme algoritması geliştirmişlerdir [14].…”

Section: Li̇teratür Araştirmasi (Literature Research)unclassified

A solution approach for vehicle routing problem with simultaneous pickup and delivery

Yazg̈an¹,

Büyükyılmaz²

2018

Sakarya University Journal of Science

View full text Add to dashboard Cite

Eş zamanlı topla dağıt araç rotalama problemi; müşterilerin dağıtım ve toplama taleplerinin eş zamanlı olarak karşılandığı bir araç rotalama problemidir. Bu çalışma kapsamında bir ana depo üzerinden 76 müşteriye hizmet sağlayacak bir firmanın araç rotalama problemi ele alınmıştır. Minimum sayıda araç kullanımı ile gidilen mesafeyi en küçükleyecek araç rotalarının oluşturulması hedeflenmiştir. Problem çözümü için literatürde yer alan karışık tamsayılı matematiksel model kullanılmış ve sezgisel bir algoritma geliştirilmiştir. Farklı büyüklükteki veri setlerine algoritma uygulanmış elde edilen çözümler regresyon analizi ile değerlendirilmiştir. Anahtar Kelimeler: eş zamanlı topla dağıt araç rotalama problemi, en kısa yol yöntemi, regresyon analizi

show abstract

“…DE was first introduced by Storn and Price (1997) and is one of the most powerful techniques effectively applied for continuous optimization. DE has been successfully applied in several fields, such as production scheduling (see Wisittipanich and Kachitvichyanukul (2011), Chakaravarthy et al (2013)), simple assembly line balancing (see Pitakaso and Sethanan (2015)), scheduling vehicle problems (see Erbao (2008), Erbao and Mingyong (2009), Lai and Cao (2010), Chen et al (2010), Sun et al 2012, Dechampai et al (2015)), and manufacturing problems (see Nearchou (2006), Weaver et al (2012). To the best of our knowledge, no metaheuristic algorithm has been applied to unrelated parallel machines with SDST, and machine eligibility with minimization of the makespan (R m |M j ,S jk |C max ).…”

Section: Literature Reviewmentioning

confidence: 99%

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Moonsri¹,

Sethanan²,

Sangsawang³

2015

CMUJNS

View full text Add to dashboard Cite

This research focuses on the parallel machines scheduling problem in the hard disk drive industry, with the objective of minimizing the makespan. In this problem, unrelated parallel machines with sequence-dependent setup time and machine eligibility are considered. This problem can be formulated as a deterministic R m |M j ,S jk |C max problem. To solve the problem, a mathematical model is developed for small-sized problems. For large-scale problems, algorithms based on a constructive heuristic (Unrelated Parallel Machines with Sequence-Dependent Setup Times and Machine eligibility (UPSDSTM)) and Differential Evolution (DE) are applied. The results demonstrate that the DE algorithm is very efficient. It yields higher relative improvement (RI) on the makespan.

show abstract

A Differential Evolution & Genetic Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pick-up and Time Windows

Cited by 8 publications

References 7 publications

Identification of reverse logistics decision types from mathematical models

Identification of reverse logistics decision types from mathematical models

A solution approach for vehicle routing problem with simultaneous pickup and delivery

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Contact Info

Product

Resources

About