Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Source URL: ceur-ws.org

• Operations research
• Mathematical optimization
• Search algorithms
• NP-complete problems
• Combinatorial optimization
• Variable neighborhood search
• Vehicle routing problem
• Travelling salesman problem
• Heuristic
• A* search algorithm
• Lagrangian relaxation
• Local search

A Heuristic Routing Mechanism Using a New Addressing Scheme M. Ravanbakhsh1, Y. Abbasi-Yadkori1, M. Abbaspour1,3, H. Sarbazi-Azad1,2 1 IPM, School of Computer Science, Tehran, Iran Department of Computer Engineering, Sha

Source URL: webdocs.cs.ualberta.ca

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

Artificial Intelligence–123 Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart

Source URL: rakaposhi.eas.asu.edu

• Mathematics
• Heuristics
• Cognition
• Game artificial intelligence
• Routing algorithms
• Search algorithms
• NP-complete problems
• A* search algorithm
• Applied mathematics
• Admissible heuristic
• Algorithm
• 15 puzzle

A Heuristic Routing Mechanism Using a New Addressing Scheme M. Ravanbakhsh1, Y. Abbasi-Yadkori1, M. Abbaspour1,3, H. Sarbazi-Azad1,2 1 IPM, School of Computer Science, Tehran, Iran Department of Computer Engineering, Sha

Source URL: webdocs.cs.ualberta.ca

Walk the Line: Consistent Network Updates with Bandwidth Guarantees Soudeh Ghorbani and Matthew Caesar Department of Computer Science University of Illinois at Urbana-Champaign 201 North Goodwin Avenue

Source URL: web.engr.illinois.edu

• Routing algorithms
• Search algorithms
• Mathematics
• Combinatorial optimization
• Game artificial intelligence
• A* search algorithm
• Routing
• Computing
• Applied mathematics
• Heuristic
• Edsger W. Dijkstra
• Hyper-V

Vehicle Routing for a Complex Waste Collection Problem Iliya Markov, Ecole Polytechnique Fédérale de Lausanne Sacha Varone, Haute Ecole de Gestion de Genève Michel Bierlaire, Ecole Polytechnique Fédérale de Lausanne

Source URL: www.strc.ch

• NP-complete problems
• Operations research
• Vehicle routing problem
• Travelling salesman problem
• Applied mathematics
• Mathematics
• Variable neighborhood search
• Partition problem
• Heuristic
• Simulated annealing
• Theoretical computer science

Decision-aid Methodology for the School Bus Routing and Scheduling Problem Michela Spada, ROSO-IMA-EPFL Michel Bierlaire, ROSO-IMA-EPFL Thomas Liebling, ROSO-IMA-EPFL

Source URL: www.strc.ch

• Operations research
• Combinatorial optimization
• Mathematical optimization
• NP-complete problems
• Travelling salesman problem
• Integer programming
• School bus
• Branch and bound
• Bus
• Heuristic
• Lagrangian relaxation

PNBA*: A Parallel Bidirectional Heuristic Search Algorithm Luis Henrique Oliveira Rios1 , Luiz Chaimowicz1 1 Departamento de Ciˆencia da Computac¸a˜ o Universidade Federal de Minas Gerais (UFMG) – Belo Horizonte, MG

Source URL: homepages.dcc.ufmg.br

• Applied mathematics
• Game artificial intelligence
• Heuristics
• Combinatorial optimization
• Routing algorithms
• A* search algorithm
• Heuristic function
• Heuristic
• Pathfinding
• Mathematics
• Search algorithms
• Theoretical computer science

Walk the Line: Consistent Network Updates with Bandwidth Guarantees Soudeh Ghorbani and Matthew Caesar Department of Computer Science University of Illinois at Urbana-Champaign 201 North Goodwin Avenue

Source URL: conferences.sigcomm.org

• Routing algorithms
• Search algorithms
• Combinatorial optimization
• Game artificial intelligence
• Network theory
• Heuristic function
• Routing
• A* search algorithm
• Shortest path problem
• Mathematics
• Graph theory
• Theoretical computer science