Pages that link to "Item:Q1751914"
From MaRDI portal
The following pages link to A metaheuristic for the time-dependent pollution-routing problem (Q1751914):
Displaying 37 items.
- A matheuristic approach for the pollution-routing problem (Q319140) (← links)
- A speed and departure time optimization algorithm for the pollution-routing problem (Q320086) (← links)
- Vehicle routing to minimize time-dependent emissions in urban areas (Q322706) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem (Q1651558) (← links)
- Determining time-dependent minimum cost paths under several objectives (Q1722968) (← links)
- Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition (Q1727293) (← links)
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty (Q2030315) (← links)
- A time-dependent Green location-routing problem with variable speed of vehicles (Q2085501) (← links)
- The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
- An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930) (← links)
- A time-dependent vessel routing problem with speed optimization (Q2158051) (← links)
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem (Q2165264) (← links)
- Carbon pricing initiatives-based bi-level pollution routing problem (Q2184108) (← links)
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) (← links)
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots (Q2240065) (← links)
- An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
- The bi-objective pollution-routing problem (Q2255967) (← links)
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics (Q2289931) (← links)
- Using cost change estimates in a local search heuristic for the pollution routing problem (Q2362177) (← links)
- A heuristic approach for a real-world electric vehicle routing problem (Q2632520) (← links)
- The continuous pollution routing problem (Q2660100) (← links)
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← links)
- A tabu search algorithm to solve a green logistics bi-objective bi-level problem (Q2675705) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Finding least fuel emission paths in a network with time-varying speeds (Q2811326) (← links)
- Survey on the relation between road freight transport, SCM and sustainable development (Q3388422) (← links)
- Comments on: ``Perspectives on integer programming for time-dependent models'' (Q5970689) (← links)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
- Fuel-optimal truck path and speed profile in dynamic conditions: an exact algorithm (Q6106795) (← links)
- Eco-routing problem for the delivery of perishable products (Q6109571) (← links)
- Monitoring a Fleet of Autonomous Vehicles Through A* Like Algorithms and Reinforcement Learning (Q6110180) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry (Q6167423) (← links)
