The Container Transshipment Problem: Searching Representation Landscapes with Metaheuristic Algorithms

Author： Scott Dan   Verity-Harrison Andy   Reeves Colin  

Publisher： Springer Publishing Company

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.5, Iss.3, 2006-09, pp. : 273-289

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 Hybrid Metaheuristic for the Quadratic Assignment Problem

By Tseng Lin-Yu   Liang Shyi-Ching  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 85-113

Springer Publishing Company

Access to resources Recommend Favorite

Two effective hybrid metaheuristic algorithms for minimization of multimodal functions

By Babaie-Kafaki Saman  

International Journal of Computer Mathematics, Vol. 88, Iss. 11, 2011-07 ,pp. : 2415-2428

Taylor & Francis Ltd

Access to resources Recommend Favorite

An LP-based metaheuristic procedure for the k-sequential generalized assignment problem

By French A. P.   Nygreen B.   Wilson J. M.  

Optimization Methods and Software, Vol. 26, Iss. 2, 2011-04 ,pp. : 225-238

Taylor & Francis Ltd

Access to resources Recommend Favorite

A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem

By Claro João   Sousa Jorge  

Computational Optimization and Applications, Vol. 46, Iss. 3, 2010-07 ,pp. : 427-450

Springer Publishing Company

Access to resources Recommend Favorite

A Hybrid Meta-Heuristic for the Batching Problem in Just-In-Time Flow Shops

By Yavuz Mesut   Akcali Elif   Tufekci Suleyman  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 3, 2006-09 ,pp. : 371-393

Springer Publishing Company

Access to resources Recommend Favorite