The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

Author： Deitch R.   Ladany S.P.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.127, Iss.1, 2000-11, pp. : 69-77

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A fast and effective heuristic for the orienteering problem

By Miyachi Y.   I-Ming C.   Golden B.L.   Wasil E.A.  

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 475-489

Elsevier

Access to resources Recommend Favorite

The team orienteering problem

By I-Ming C.   Golden B.L.   Wasil E.A.  

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 464-474

Elsevier

Access to resources Recommend Favorite

A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem

By Vigo D.  

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 108-126

Elsevier

Access to resources Recommend Favorite

A heuristic algorithm for the mini-max spanning forest problem

By Yamada T.   Takahashi H.   Kataoka S.  

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 565-572

Elsevier

Access to resources Recommend Favorite

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

By Malandraki C.   Dial R.B.  

European Journal of Operational Research, Vol. 90, Iss. 1, 1996-04 ,pp. : 45-55

Elsevier

Access to resources Recommend Favorite