Challenges and Advances in A Priori Routing (Q3564352)

From MaRDI portal

Revision as of 20:52, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Challenges and Advances in A Priori Routing

scientific article

Language	Label	Description	Also known as
English	Challenges and Advances in A Priori Routing	scientific article

Statements

scholarly article

0 references

Challenges and Advances in A Priori Routing (English)

0 references

Ann Melissa Campbell

0 references

Barrett W. Thomas

0 references

Operations Research/Computer Science Interfaces

0 references

publication date

2 June 2010

0 references

zbMATH Keywords

stochastic routing

0 references

a priori routing

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-0-387-77778-8_6

0 references

An O(N log N) planar travelling salesman heuristic based on spacefilling curves

0 references

The stochastic vehicle routing problem revisited

0 references

Vehicle routing with a sparse feasibility graph

0 references

The vehicle scheduling problem with intermittent customer demands

0 references

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

0 references

Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers

0 references

Further results on the probabilistic traveling salesman problem

0 references

A Priori Optimization

0 references

Computational Approaches to Stochastic Vehicle Routing Problems

0 references

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

0 references

Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms

0 references

Introduction to Stochastic Programming

0 references

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands

0 references

Solving the probabilistic TSP with ant colony optimization

0 references

Aggregation for the probabilistic traveling salesman problem

0 references

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

0 references

Chance-Constrained Programming

0 references

Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints

0 references

Aggregation effects in maximum covering models

0 references

0 references

Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution

0 references

Stochastic vehicle routing with modified savings algorithm

0 references

Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks

0 references

On worst-case aggregation analysis for network location problems

0 references

An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers

0 references

Stochastic vehicle routing

0 references

A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

0 references

0 references

Quantifying the benefits of route reoptimisation under stochastic customer demands

0 references

A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited

0 references

Models and exact solutions for a class of stochastic location-routing problems

0 references

A Priori Optimization of the Probabilistic Traveling Salesman Problem

0 references

0 references

Computer Solutions of the Traveling Salesman Problem

0 references

Discrete-Time Finite Horizon Approximation of Infinite Horizon Optimization Problems with Steady-State Invariance

0 references

Using aggregation to optimize long-term production planning at an underground mine

0 references

A \(p\)-center grid-positioning aggregation procedure

0 references

0 references

0 references

Stochastic vehicle routing: A comprehensive approach

0 references

A TABU search heuristic for the team orienteering problem

0 references

AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES

0 references

Vehicle-scheduling Problems with Uncertainty and Omitted Customers

0 references

Stochastic Vehicle Routing Problem with Restocking

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-0-387-77778-8_6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3564352

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3564352&oldid=35172682"