Pages that link to "Item:Q1926884"
From MaRDI portal
The following pages link to A simple and effective metaheuristic for the minimum latency problem (Q1926884):
Displaying 39 items.
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- A performance study on multi improvement neighborhood search strategy (Q1687681) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach (Q1988950) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← 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 unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← 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)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Solving the clustered traveling salesman problem with ‐relaxed priority rule (Q6070874) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems (Q6568437) (← links)
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty (Q6588503) (← links)
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)
