Pages that link to "Item:Q3779986"
From MaRDI portal
The following pages link to Survey Paper—Time Window Constrained Routing and Scheduling Problems (Q3779986):
Displaying 50 items.
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization (Q264238) (← links)
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits (Q279819) (← links)
- Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization (Q460244) (← links)
- Implementing an insertion heuristic for vehicle routing on parallel hardware (Q690016) (← links)
- On scheduling around large restrictive common due windows (Q704121) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- The timetable constrained distance minimization problem (Q846138) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- Vehicle routing problem with fuzzy time windows (Q1037889) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method (Q1044088) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- A practical heuristic for a large scale vehicle routing problem (Q1197957) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- Single-vehicle scheduling with time window constraints (Q1297696) (← links)
- Analysis of the temporal decomposition procedure for scheduling with release and due dates (Q1303726) (← links)
- Use of a fuzzy theory technique for grouping of trips in the vehicle routing and scheduling problem (Q1331560) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
- Modeling rolling batch planning as vehicle routing problem with time windows. (Q1406729) (← links)
- A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations. (Q1413870) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
- Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016) (← links)
- Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis (Q1674845) (← links)
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
- Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096) (← links)
- Fleet assignment and routing with schedule synchronization constraints (Q1806762) (← links)
- School-bus routing for program scheduling (Q1823853) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- Intelligent transportation systems -- Enabling technologies (Q1906952) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)