نتایج جستجو برای: Capacitated vehicle routing problem . Combinatorial optimization . Cuckoo search . Le´vy flights

تعداد نتایج: 1598906  

Cinmayii Manliguez Jon Henly Santillan Samantha Tapucar Vicente Calag

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

2016
ALI OTHMAN

The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...

Journal: :Journal of Industrial Engineering International 2017

Journal: :journal of advances in computer research 2016
arash mazidi mostafa fakhrahmad mohammadhadi sadreddini

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

Journal: :journal of advances in computer research 2012
majid yousefikhoshbakht farzad didehvar farhad rahmati

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

Farhad Rahmati Farzad Didehvar Majid Yousefikhoshbakht,

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

Farhad Rahmati Farzad Didehvar Majid Yousefikhoshbakht,

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

Journal: :journal of industrial engineering and management studies 0
m. sayyah department of mathematics, parand branch, islamic azad university, parand, iran. h. larki department of mathematics, shahid chamran university of ahvaz, iran. m. yousefikhoshbakht young researchers & elite club, hamedan branch, islamic azad university, hamedan, iran.

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید