Back to Results
First PageMeta Content
Mathematics / NP-complete problems / Supply chain management / Marketing / Heuristics / Inventory / Vehicle routing problem / Travelling salesman problem / Heuristic function / Business / Theoretical computer science / Operations research


INFORMS TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn | eissn | 00 | 0000 | 0001
Add to Reading List

Document Date: 2011-03-16 02:49:18


Open Document

File Size: 211,46 KB

Share Result on Facebook

Company

Estellon / /

/

Facility

plant IRP / /

IndustryTerm

satellite facilities / local-search algorithms / transportation / greedy algorithms / then reach better-quality solutions / different site / local-search scheme / greedy randomized adaptive search procedure / feasible solution / incremental evaluation machinery / greedy algorithm / local search / incremental approximation algorithm / volume assignment algorithm / direct local-search approach / local-search heuristic / constructive algorithm / search strategy / travel time / randomized local search / transportation costs / e-lab / long-term solutions / search tree / short computing times / pure and direct local-search heuristic / local-search approach / classical urgency-based constructive algorithm / feasible solutions / local-search techniques / infeasible solution / /

OperatingSystem

Aix / /

Person

Thierry Benoist / Antoine Jeanjean Bouygues / Bertrand Estellon Laboratoire / /

Position

driver / salesman / /

Technology

incremental approximation algorithm / local-search algorithms / classical urgency-based constructive algorithm / volume assignment algorithm / hybridization / constructive algorithm / greedy algorithm / decision support system / three greedy algorithms / /

SocialTag