<--- Back to Details
First PageDocument Content
Electronics / Routing algorithms / Wireless networking / Heuristic routing / Electronic engineering / Routing protocols / Routing
Date: 2013-09-13 16:46:55
Electronics
Routing algorithms
Wireless networking
Heuristic routing
Electronic engineering
Routing protocols
Routing

Add to Reading List

Source URL: users.eecs.northwestern.edu

Download Document from Source Website

File Size: 337,58 KB

Share Document on Facebook

Similar Documents

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

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

DocID: 1oRzZ - View Document

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

DocID: 1o0uC - View Document

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

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,

DocID: 1n8kS - View Document

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

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

DocID: 1mDLh - View Document

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

DocID: 1mbef - View Document