Pages that link to "Item:Q322826"
From MaRDI portal
The following pages link to Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826):
Displayed 28 items.
- Simultaneous product and service delivery vehicle routing problem with time windows and order release dates (Q822105) (← links)
- Transportation service procurement bid construction problem from less than truckload perspective (Q1720469) (← links)
- Collaborative vehicle routing: a survey (Q1754297) (← links)
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
- Transportation outsourcing problems considering feasible probabilities under stochastic demands (Q2026971) (← links)
- Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots (Q2029292) (← links)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets (Q2057127) (← links)
- Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← links)
- Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery (Q2099865) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- The vehicle routing problem with simultaneous pickup and delivery and handling costs (Q2289929) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Scheduling heterogeneous multi-load AGVs with battery constraints (Q2669605) (← links)
- A hybrid metaheuristic for smart waste collection problems with workload concerns (Q2669623) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
- Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles (Q6071125) (← links)
- Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks (Q6099452) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
- A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems (Q6112785) (← 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)