PSO algorithms for generalized multi-depot vehicle routing problems with pickup and delivery requests | |
| Author | Pandhapon Sombuntham |
| Call Number | AIT Thesis no.ISE-10-07 |
| Subject(s) | Vehicle routing problem Terminals (Transportation) |
| Note | A thesis submitted in partial fulfillment of the re quirements for the degree of Master of Engineering in Industrial and Manufacturing Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. ISE-10-07 |
| Abstract | This research presents a generalized version of the vehicle routing problem which includes the additional practical aspects of multiple-role l ocation and many requests at locations. Other practical considerations are also taken into account such as time constraints, different characteristics of vehicles, and multi-de pot. The objective is to provide a near- optimal solution method for the specified vehicle r outing problem. The problem is introduced with the mathematical for mulation that has the objectives to minimize a single aggregate objective function of c ost incurs from the number of vehicles and the total traveled distance. Three algorithms a re proposed based on PSO framework namely SD1, SD2, and SD3. The potentials of the proposed algorithms are revea led by the preliminary evaluation using the pickup and delivery problems as benchmark insta nces. For further analysis, sets of instances are newly generated for the evaluation. F rom the experiments, the results show that number of location and requests significantly affect the computational efforts, and the small size swarm with long iteration provides good solutions for 100-request problems. The algorithm SD1 requires the longest computationa l time and seems to be the most robust in the case of half-random-half-clustered lo cations. SD2 requires the least computational effort, but gives inconsistent soluti on quality. The algorithm SD3 tends to outperform others in term of providing a good solut ion within reasonable time. Moreover, the applicability of the algorithm for multi-object ive VRP is also demonstrated. |
| Year | 2010 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. ISE-10-07 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Systems Engineering (ISE) |
| Chairperson(s) | Voratas Kachitvichyanukul |
| Examination Committee(s) | Huynh Trung Luong;Pisut Koomsap |
| Scholarship Donor(s) | RTG Fellowship |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2010 |