Download scientific diagram | Model of VRP Assumptions (1) The selected locations are known, and the hospital points are also known. (2) The sum of infectious waste material should not be higher than the maximum load of transport vehicles. (3) Each transport vehicle takes the selected location as the starting point, and then returns back to the selected location. (4) The amount of infectious waste is determinate. (5) One vehicle can serve multiple hospitals. (6) Each vehicle travels from node i to j at a speed of 60 kilometers per hour. from publication: Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm | Infectious waste disposal remains one of the most serious problems in the medical, social and environmental domains of almost every country. Selection of new suitable locations and finding the optimal set of transport routes for a fleet of vehicles to transport infectious | Goal Programming, Routing and Genetic Algorithm | ResearchGate, the professional network for scientists.
Can reinforcement learning solve the NP-Hard problems?
Vehicle routing problem - Wikipedia
PDF) Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm
Vehicle Routing SIAM Publications Library
Mathematics, Free Full-Text
PDF) Parking lots assignment algorithm for vehicles requiring specific parking conditions in Vehicle Routing Problem
Porntep KHOKHAJAIKIAT, Professor (Associate), Khon Kaen University, Khon Kaen, KKU, Department of Industrial Engineering
Scheduling the periodic delivery of liquefied petroleum gas tank with time window by using artificial intelligence approaches: An example in Taiwan - Yi-Chih Hsieh, Peng-Sheng You, Cheng-Sheng Chen, 2021
Global Volcanism Program Bulletin of the Global Volcanism Network
PDF) THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES