Pages that link to "Item:Q4004741"

The following pages link to A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows (Q4004741):

Displaying 50 items.

• A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
• Single-vehicle scheduling with time window constraints (Q1297696) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
• Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
• Towards a decision support system for the ready concrete distribution system: a case of a Greek company. (Q1412756) (← links)
• A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
• Shipping problems with body clock constraints. (Q1423446) (← links)
• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
• Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
• Empirical analysis for the VRPTW with a multigraph representation for the road network (Q1651529) (← links)
• Full-shipload tramp ship routing and scheduling with variable speeds (Q1651617) (← links)
• A column generation approach for the location-routing problem with time windows (Q1652527) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• The robust vehicle routing problem with time windows: solution by branch and price and cut (Q1719626) (← links)
• Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (Q1751334) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096) (← links)
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation (Q1761961) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
• Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
• On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Finding \(K\) shortest looping paths in a traffic-light network (Q1886860) (← links)
• The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
• A new branching strategy for time constrained routing problems with application to backhauling (Q1908295) (← links)
• A heuristic method for dispatching repair men (Q1908307) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
• Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
• Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
• A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
• Record breaking optimization results using the ruin and recreate principle (Q1976826) (← links)
• Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• The pickup and delivery problem with time windows and occasional drivers (Q2003570) (← links)
• A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico (Q2004887) (← links)
• The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
• A vehicle routing problem with distribution uncertainty in deadlines (Q2030574) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)