Pages that link to "Item:Q2514767"
From MaRDI portal
The following pages link to A unified solution framework for multi-attribute vehicle routing problems (Q2514767):
Displaying 50 items.
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- Solution strategies for the vehicle routing problem with backhauls (Q2228411) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- Bi-objective offshore supply vessel planning with costs and persistence objectives (Q2273681) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Bidirectional labeling for solving vehicle routing and truck driver scheduling problems (Q2286924) (← links)
- A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
- Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem (Q2664434) (← links)
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
- Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771) (← links)
- Step cost functions in a fleet size and mix vehicle routing problem with time windows (Q2675711) (← links)
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem (Q2676358) (← links)
- Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- (Q4467036) (← links)
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
- Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows (Q4685785) (← links)
- Development and implementation of algorithms for vehicle routing during a no-notice evacuation (Q4966752) (← links)
- Robust Data-Driven Vehicle Routing with Time Windows (Q4994169) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)
- Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function (Q5139622) (← links)
- Simple heuristics for the multi-period fleet size and mix vehicle routing problem (Q5879646) (← links)
- Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction (Q5881167) (← links)
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Solving the multi‐objective bike routing problem by meta‐heuristic algorithms (Q6079858) (← links)
- Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit (Q6087499) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
- On the general problem statement of cargo carriages scheduling and ways to solve it (Q6094338) (← links)
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
- An improved memetic algorithm for integrated production scheduling and vehicle routing decisions (Q6109340) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
- Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem (Q6164388) (← links)
- An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows (Q6164607) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
- The board packing problem (Q6167668) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
