Pages that link to "Item:Q2496063"

The following pages link to Waste collection vehicle routing problem with time windows (Q2496063):

Displaying 43 items.

• The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
• A variable neighborhood search for the multi-period collection of recyclable materials (Q320992) (← links)
• The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
• Sustainable operations (Q323159) (← links)
• Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
• A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
• A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
• A bi-objective model for the used oil location-routing problem (Q337643) (← links)
• Metaheuristics with disposal facility positioning for the waste collection VRP with time windows (Q375982) (← links)
• The linehaul-feeder vehicle routing problem with virtual depots and time windows (Q410539) (← links)
• An improved ant colony algorithm and its application in vehicle routing problem (Q474637) (← links)
• Visual attractiveness in routing problems: a review (Q1634050) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
• The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem (Q1752875) (← links)
• A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection (Q1754088) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• Workload equity in vehicle routing: the impact of alternative workload resources (Q2002854) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• Optimal planning of waste sorting operations through mixed integer linear programming (Q2056920) (← links)
• Planning sustainable routes: economic, environmental and welfare concerns (Q2140143) (← links)
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes (Q2178911) (← links)
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
• Waste collection inventory routing with non-stationary stochastic demands (Q2333149) (← links)
• An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision (Q2337389) (← links)
• A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)
• A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
• Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
• A hybrid metaheuristic for smart waste collection problems with workload concerns (Q2669623) (← links)
• REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS (Q2920362) (← links)
• A simheuristic algorithm for time-dependent waste collection management with stochastic travel times (Q5158698) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)
• Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows (Q6160120) (← links)
• A memetic algorithm for solving rich waste collection problems (Q6167528) (← links)
• Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers (Q6551071) (← links)
• The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations (Q6556096) (← links)
• Waste collection routing: a survey on problems and methods (Q6558657) (← links)