Pages that link to "Item:Q1762031"
From MaRDI portal
The following pages link to An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031):
Displaying 50 items.
- Elective course student sectioning at Danish high schools (Q284401) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- The latency location-routing problem (Q323569) (← links)
- Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping (Q342095) (← links)
- An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
- An adaptive large neighborhood search for relocating vehicles in electric carsharing services (Q1634774) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- The periodic supply vessel planning problem with flexible departure times and coupled vessels (Q1652603) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← 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)
- An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← 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)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- Robust car sequencing for automotive assembly (Q2030663) (← links)
- Distance-based adaptive large neighborhood search algorithm for green-PDPTW (Q2039686) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
- New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- Modeling emergency response operations: a theory building survey (Q2177817) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions (Q2242377) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits (Q2289922) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- The consultation timetabling problem at Danish high schools (Q2359151) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- A heuristic approach for a real-world electric vehicle routing problem (Q2632520) (← links)
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem (Q2669499) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)