The cross-entropy (CE) method is a new generic approach to combinatorial and multi-
extremal optimization and rare event simulation. The purpose of this tutorial is to give a …

The Traveling Salesman Problem: An overview of exact and approximate algorithms Page 1
European Journal of Operational Research 59 (1992) 231-247 231 North-Holland Invited …

Authored by a team of experts, the new edition of this bestseller presents practical
techniques for managing inventory and production throughout supply chains. It covers the …

This paper proposes a crowdsource-enabled system for urban parcel relay and delivery. We
consider cyclists and pedestrians as crowdsources who are close to customers and …

A general framework for constructing and using probabilistic models of complex systems that
would enable a computer to use available information for making decisions. Most tasks …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

This paper presents the fundamental principles underlying tabu search as a strategy for
combinatorial optimization problems. Tabu search has achieved impressive practical …

The cross-entropy (CE) method is one of the most significant developments in stochastic
optimization and simulation in recent years. This book explains in detail how and why the …

Systematic change of neighborhood within a possibly randomized local search algorithm
yields a simple and effective metaheuristic for combinatorial and global optimization, called …

This volume introduces the latest popular methods for conducting business research. The
goal of each chapter author--a leading authority in a particular subject area--is to provide an …