Pages that link to "Item:Q1976826"
From MaRDI portal
The following pages link to Record breaking optimization results using the ruin and recreate principle (Q1976826):
Displaying 50 items.
- Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
- A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- Multi-directional local search (Q339654) (← links)
- Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- The orienteering problem with stochastic travel and service times (Q646634) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
- Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Analysis, modeling and solution of the concrete delivery problem (Q954932) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints (Q1651588) (← links)
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
- A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- A set partitioning heuristic for the home health care routing and scheduling problem (Q1711476) (← links)
- A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem (Q1744527) (← links)
- Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems (Q1751207) (← links)
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
- Heuristic optimisation in financial modelling (Q1931632) (← links)
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
- A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- Neural large neighborhood search for routing problems (Q2093389) (← links)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- The prisoner transportation problem (Q2178139) (← links)
- The dynamic multi-period vehicle routing problem (Q2270447) (← links)
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
