Application of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic Conditions | Science Publications

Journal of Computer Science

S. Patvichaichod¹ 

关键词: Hybrid encoding;    genetic algorithm;    traveling salesman problem;    Traveling Salesman Problem with Multi-Relations (TSPMR);    Pickup and Delivery Traveling Salesman Problem (PDTSP);    multiple Traveling Salesperson Problem (m-TSP);    traffic conditions;    vehicle conditions;    Vehicle Routing Problem (VRP);   

DOI  :  10.3844/jcssp.2011.605.610

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

Problem statement: This study deals with the pickup and delivery traveling salesmanproblem with traffic conditions (PDTSPTW), an extension of the pickup and delivery travelingsalesman problem (PDTSP) where each customer to be served is associated with two quantities ofproduct to be collected and delivered. Almost PDTSP problems uses distance between each point ofcustomers as Euclidean Distance and are not concerned with other parameters to find minimal cost.Approach: The PDTSPTC concerns more parameters, such as street network and vehicle speed, whichresults it closer to the real world condition. The study also proposes the developed genetic algorithmcalled

【 授权许可】

Unknown