✦ LIBER ✦

A Branch and Bound algorithm for minimizing the energy consumption of an electrical vehicle

✍ Scribed by Merakeb, Abdelkader; Messine, Frédéric; Aidène, Mohamed

Book ID: 125353644
Publisher: Springer
Year: 2013
Tongue: English
Weight: 868 KB
Volume: 12
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-013-0247-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated vehicle routing problem

✍ G. Laporte; Y. Nobert 📂 Article 📅 1983 🏛 Springer 🌐 German ⚖ 643 KB

A branch and bound algorithm for the mul

A branch and bound algorithm for the multiple depot vehicle scheduling problem

✍ G. Carpaneto; M. Dell'amico; M. Fischetti; P. Toth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

A new branch and bound algorithm for min

A new branch and bound algorithm for minimizing the weighted number of tardy jobs

✍ Guochun Tang 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 310 KB

A branch and bound algorithm for minimiz

A branch and bound algorithm for minimizing the expected cost of testing coherent systems

✍ Yosi Ben-dov 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 390 KB

A branch-and-bound algorithm for the asy

A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem

✍ G. Laporte; Y. Nobert; S. Taillefer 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 771 KB

A branch-and-bound algorithm for flow-pa

A branch-and-bound algorithm for flow-path design of automated guided vehicle systems

✍ M. A. Venkataramanan; Kathryn A. Wilson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that th