Faster access than browser!
21 relations: Arc routing, Combinatorial optimization, Complete graph, Directed graph, European Union, Genetic algorithm, George Dantzig, Graph (discrete mathematics), Gross domestic product, Integer programming, Job shop scheduling, Mathematical optimization, Metaheuristic, NP-hardness, Route inspection problem, Shortest path problem, Simulated annealing, Stack (abstract data type), Tabu search, Travelling salesman problem, Vehicle rescheduling problem.
Arc routing
Arc Routing is the process of selecting the best path in a network based on the route.
New!!: Vehicle routing problem and Arc routing · See more »
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
New!!: Vehicle routing problem and Combinatorial optimization · See more »
Complete graph
No description.
New!!: Vehicle routing problem and Complete graph · See more »
Directed graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.
New!!: Vehicle routing problem and Directed graph · See more »
European Union
The European Union (EU) is a political and economic union of EUnum member states that are located primarily in Europe.
New!!: Vehicle routing problem and European Union · See more »
Genetic algorithm
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA).
New!!: Vehicle routing problem and Genetic algorithm · See more »
George Dantzig
George Bernard Dantzig (November 8, 1914 – May 13, 2005) was an American mathematical scientist who made important contributions to operations research, computer science, economics, and statistics.
New!!: Vehicle routing problem and George Dantzig · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Vehicle routing problem and Graph (discrete mathematics) · See more »
Gross domestic product
Gross domestic product (GDP) is a monetary measure of the market value of all final goods and services produced in a period (quarterly or yearly) of time.
New!!: Vehicle routing problem and Gross domestic product · See more »
Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.
New!!: Vehicle routing problem and Integer programming · See more »
Job shop scheduling
Job shop scheduling or the job-shop problem (JSP) is an optimization problem in computer science and operations research in which jobs are assigned to resources at particular times.
New!!: Vehicle routing problem and Job shop scheduling · See more »
Mathematical optimization
In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.
New!!: Vehicle routing problem and Mathematical optimization · See more »
Metaheuristic
In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem, especially with incomplete or imperfect information or limited computation capacity.
New!!: Vehicle routing problem and Metaheuristic · See more »
NP-hardness
NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".
New!!: Vehicle routing problem and NP-hardness · See more »
Route inspection problem
In graph theory, a branch of mathematics and computer science, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph.
New!!: Vehicle routing problem and Route inspection problem · See more »
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
New!!: Vehicle routing problem and Shortest path problem · See more »
Simulated annealing
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function.
New!!: Vehicle routing problem and Simulated annealing · See more »
Stack (abstract data type)
In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations.
New!!: Vehicle routing problem and Stack (abstract data type) · See more »
Tabu search
Tabu search, created by Fred W. Glover in 1986 and formalized in 1989, is a metaheuristic search method employing local search methods used for mathematical optimization.
New!!: Vehicle routing problem and Tabu search · See more »
Travelling salesman problem
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
New!!: Vehicle routing problem and Travelling salesman problem · See more »
Vehicle rescheduling problem
The vehicle rescheduling problem (VRSP) is a combinatorial optimization and integer programming problem seeking to service customers on a trip after change of schedule such as vehicle break down or major delay.
New!!: Vehicle routing problem and Vehicle rescheduling problem · See more »
Redirects here:
Exact solutions of the vehicle routing problem, Jsprit, VRPTW, Vehicle routing.
References
[1] https://en.wikipedia.org/wiki/Vehicle_routing_problem
