Pages that link to "Item:Q2513752"
From MaRDI portal
The following pages link to A survey on matheuristics for routing problems (Q2513752):
Displaying 50 items.
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
- Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- The two-echelon multi-depot inventory-routing problem (Q1628063) (← links)
- Home health care routing and scheduling: a review (Q1652024) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking (Q1652321) (← links)
- Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- Typology and literature review for dial-a-ride problems (Q1698288) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
- Scheduling taxi services for a team of car relocators (Q2027080) (← links)
- A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
- The collaborative consistent vehicle routing problem with workload balance (Q2030339) (← links)
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
- Sells optimization through product rotation (Q2089611) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- The heterogeneous fleet vehicle routing problem with draft limits (Q2108117) (← links)
- E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles (Q2171599) (← links)
- Liner shipping network design (Q2184083) (← links)
- Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities (Q2240012) (← links)
- Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
- A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
- Matheuristics for slot planning of container vessel bays (Q2286874) (← links)
- Scheduling of maintenance windows in a mining supply chain rail network (Q2289897) (← links)
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)
- The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
- A matheuristic for the air transportation freight forwarder service problem (Q2664338) (← links)
- An iterative matheuristic for the inventory routing problem (Q2668692) (← links)
- Vehicle routing with private and shared delivery locations (Q2668792) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study (Q2676339) (← links)
- A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
- A hybrid algorithm for the drilling rig routing problem (Q5100126) (← links)
- Optimization in liner shipping (Q5892394) (← links)
- Optimization in liner shipping (Q5915966) (← links)
- An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping (Q6047843) (← links)
