Pages that link to "Item:Q1948529"

The following pages link to MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529):

Displaying 12 items.

• A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals (Q1686533) (← links)
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
• Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks (Q2140358) (← links)
• A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (Q4979997) (← links)
• Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (Q5963103) (← links)
• Multi-depot vehicle routing problem with time windows under shared depot resources (Q5963636) (← links)
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility (Q6066586) (← links)
• A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains (Q6066639) (← links)
• Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery (Q6070418) (← links)
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands (Q6070975) (← links)
• Using horizontal cooperation concepts in integrated routing and facility‐location decisions (Q6070979) (← links)