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.
Modeling and Solution of Vehicle Routing Problem with Grey Time Windows and Multiobjective Constraints
Sustainability, Free Full-Text
Improve Traditional CO2-DCV with Outdoor Airflow Measurement - EBTRON
Capacitated Vehicle Routing Problem With LINGO, by Rihot Gusron
Frontiers Closed-Loop Multiscale Computational Model of Human Blood Circulation. Applications to Ballistocardiography
PDF) Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm
Vehicle routing problem - Wikipedia
Comparison of solutions using LINGO13 and hybrid GA
PDF) Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm
Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions - ScienceDirect