In this paper, a novel vehicle routing algorithm will be presented. Proposed method will be based... more In this paper, a novel vehicle routing algorithm will be presented. Proposed method will be based on “time windows-based clustering” and “location-based clustering”, applied in reversable consecutive order. The method partitions and models the solution space with machine learning technologies, resulting in a better performance for time window and geospatial clustering calculations. Routing process, on the other hand, will be built upon already present open source tools, giving it usability, applicability, manageability, and integration perspectives. The process combines “cluster+cluster+route” units with post process enhancements. Previous works on location-based clustering are proved to be successful, albeit with some disadvantages. On the other hand, routing algorithms have mostly implemented time window calculations as second-class citizens. In this method, time window is a major ingredient of the modelling process. This paper will also differs from some other combinatoric method...
2015 4th International Conference on Advanced Logistics and Transport (ICALT), 2015
In this study, a two phase heuristic bubble approach is presented for the solution of Location-Ro... more In this study, a two phase heuristic bubble approach is presented for the solution of Location-Routing Problems (LRP), which has two subsections called Location Allocation Problem (LAP) and Vehicle Routing Problem (VRP). The proposed two phase heuristic bubble approach is designed to solve these two problems separately. A new heuristic approach is a combination of Heuristic Bubble Polygon (HBP) that is proposed for LAP and Heuristic Bubble Algorithm (HBA) that is proposed for the solution to VRP. The benefit of the proposed two phase heuristic bubble approach are studied via simulations and the obtained results are compared with Jokar method and Sahraeian methods.
2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI), 2015
ABSTRACT In this study, the Vehicle Routing Problem Pickup and Delivery with Time Windows (VRPPDT... more ABSTRACT In this study, the Vehicle Routing Problem Pickup and Delivery with Time Windows (VRPPDTW) is considered. The VRPPDTW problem is seen in many practical applications such as logistics, distribution and transportation. Firstly, a new model of the very close to real-life problem is defined. Secondly, a novel heuristic algorithm with a new objective function is proposed to solve the daily macro routing problem with time windows. The method proposed to solve VRPPDTW problem is an extended version of a nature-inspired algorithm called Heuristic Bubble Algorithm (HBA). In order to express the benefit of using extended HBA, five case studies are discussed using RouteArt. The obtained results provide promising solutions in terms of average vehicle load efficiency, average service time, and total waiting time of the vehicle.
In this paper, a novel vehicle routing algorithm will be presented. Proposed method will be based... more In this paper, a novel vehicle routing algorithm will be presented. Proposed method will be based on “time windows-based clustering” and “location-based clustering”, applied in reversable consecutive order. The method partitions and models the solution space with machine learning technologies, resulting in a better performance for time window and geospatial clustering calculations. Routing process, on the other hand, will be built upon already present open source tools, giving it usability, applicability, manageability, and integration perspectives. The process combines “cluster+cluster+route” units with post process enhancements. Previous works on location-based clustering are proved to be successful, albeit with some disadvantages. On the other hand, routing algorithms have mostly implemented time window calculations as second-class citizens. In this method, time window is a major ingredient of the modelling process. This paper will also differs from some other combinatoric method...
2015 4th International Conference on Advanced Logistics and Transport (ICALT), 2015
In this study, a two phase heuristic bubble approach is presented for the solution of Location-Ro... more In this study, a two phase heuristic bubble approach is presented for the solution of Location-Routing Problems (LRP), which has two subsections called Location Allocation Problem (LAP) and Vehicle Routing Problem (VRP). The proposed two phase heuristic bubble approach is designed to solve these two problems separately. A new heuristic approach is a combination of Heuristic Bubble Polygon (HBP) that is proposed for LAP and Heuristic Bubble Algorithm (HBA) that is proposed for the solution to VRP. The benefit of the proposed two phase heuristic bubble approach are studied via simulations and the obtained results are compared with Jokar method and Sahraeian methods.
2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI), 2015
ABSTRACT In this study, the Vehicle Routing Problem Pickup and Delivery with Time Windows (VRPPDT... more ABSTRACT In this study, the Vehicle Routing Problem Pickup and Delivery with Time Windows (VRPPDTW) is considered. The VRPPDTW problem is seen in many practical applications such as logistics, distribution and transportation. Firstly, a new model of the very close to real-life problem is defined. Secondly, a novel heuristic algorithm with a new objective function is proposed to solve the daily macro routing problem with time windows. The method proposed to solve VRPPDTW problem is an extended version of a nature-inspired algorithm called Heuristic Bubble Algorithm (HBA). In order to express the benefit of using extended HBA, five case studies are discussed using RouteArt. The obtained results provide promising solutions in terms of average vehicle load efficiency, average service time, and total waiting time of the vehicle.
Uploads
Papers by fatih yuce