Pages that link to "Item:Q2253352"

The following pages link to An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352):

Displaying 50 items.

• A review of recent research on green road freight transportation (Q296573) (← links)
• A matheuristic approach for the pollution-routing problem (Q319140) (← links)
• A speed and departure time optimization algorithm for the pollution-routing problem (Q320086) (← links)
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• Fuel emissions optimization in vehicle routing problems with time-varying speeds (Q320788) (← links)
• Vehicle routing to minimize time-dependent emissions in urban areas (Q322706) (← links)
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• An adaptive large neighborhood search heuristic for the share-a-ride problem (Q342178) (← links)
• Data-driven approaches for emissions-minimized paths in urban areas (Q342252) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• Simultaneous product and service delivery vehicle routing problem with time windows and order release dates (Q822105) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• The green mixed fleet vehicle routing problem with partial battery recharging and time windows (Q1628058) (← links)
• An adaptive large neighborhood search for relocating vehicles in electric carsharing services (Q1634774) (← links)
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
• A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← links)
• Time-dependent green Weber problem (Q1651568) (← links)
• Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
• Modeling a green inventory routing problem for perishable products with horizontal collaboration (Q1652462) (← links)
• An adaptive large neighbourhood search for asset protection during escaped wildfires (Q1652717) (← links)
• The accuracy of carbon emission and fuel consumption computations in green vehicle routing (Q1683091) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Determining time-dependent minimum cost paths under several objectives (Q1722968) (← links)
• The green location-routing problem (Q1722977) (← links)
• A meta-heuristic for capacitated green vehicle routing problem (Q1730494) (← links)
• An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows (Q1734348) (← links)
• Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
• A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
• Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
• The role of operational research in green freight transportation (Q1755374) (← links)
• Route and speed optimization for autonomous trucks (Q1782162) (← links)
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic (Q2005882) (← links)
• A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
• Two-echelon vehicle routing problem with satellite bi-synchronization (Q2028760) (← links)
• A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
• Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem (Q2030552) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• A matheuristic for AGV scheduling with battery constraints (Q2076865) (← links)