Abstract
Background: This work addresses the maximum edge weight clique problem (MEWC), an important generalization of the well-known maximum clique problem. Methods: The MEWC problem can be used to model applications in many fields including broadband network design, computer vision, pattern recognition, and robotics. We propose a random key genetic algorithm to find good quality solutions for this problem. Computational experiments are reported for a set of benchmark problem instances derived from the DIMACS maximum clique instances. Results: The results obtained show that our algorithm is both effective and efficient, as for most of the problem instances tested, we were able to match the best-known solutions with very small computational time requirements.

Abstract
Purpose The purpose of this study is to first investigate the efficiency of the most commonly used performance measures for minimizing the number of workstations (NWs) in approaches addressing simple assembly line balancing problem (SALBP) for both straight and U-shaped line, and second to provide a comparative evaluation of 20 constructive heuristics to find solutions to the SALBP-1. Design/methodology/approach A total of 200 problems are solved by 20 different constructive heuristics for both straight and U-shaped assembly line. Moreover, several comparisons have been made to evaluate the performance of constructive heuristics. Findings Minimizing the smoothness index is not necessarily equivalent to minimizing the NWs; therefore, it should not be used as the fitness function in approaches addressing the SALBP-1. Line efficiency and the idle time are indeed reliable performance measures for minimizing the NWs. The most promising heuristics for straight and U-shaped line configurations for SALBP-1 are also ranked and introduced. Practical implications Results are expected to help scholars and industrial practitioners to better design effective solution methods for having the most balanced assembly line. This study will further help with choosing the most proper heuristic with regard to the problem specifications and line configuration. Originality/value There is limited research assessing the efficiency of the common objectives for SALBP-1. This study is among the first to prove that minimizing the workload smoothness is not equivalent to minimizing the NWs in SALBP-1 studies. This work is also one of the first attempts for evaluating the constructive heuristics for both straight and U-shaped line configurations.

Abstract
Metaheuristic Algorithms in Maritime Operations Optimization focuses on the seaside and port side problems regarding the maritime transportation. The book reviews and introduces the most important problems regarding the shipping network design, long-term and short-term scheduling and planning problems in both bulk and container shipping as well as liquid maritime transportation. Application of meta heuristic algorithm is important for these problems, as most of them are hard and time-consuming to be solved optimally.

Abstract
The maximum edge weight clique (MEWC) problem, defined on a simple edge-weighted graph, is to find a subset of vertices inducing a complete subgraph with the maximum total sum of edge weights. We propose a quadratic optimization formulation for the MEWC problem and study characteristics of this formulation in terms of local and global optimality. We establish the correspondence between local maxima of the proposed formulation and maximal cliques of the underlying graph, implying that the characteristic vector of a MEWC in the graph is a global optimizer of the continuous problem. In addition, we present an exact algorithm to solve the MEWC problem. The algorithm is a combinatorial branch-and-bound procedure that takes advantage of a new upper bound as well as an efficient construction heuristic based on the proposed quadratic formulation. Results of computational experiments on some benchmark instances are also presented.

Abstract
Purpose The purpose of this study is to contribute to the existing knowledge about the process of achieving Lean Manufacturing (LM) success. Design/methodology/approach This study uses interpretive structural modeling and captures the opinions of a group of LM experts from a world-class Japanese automobile manufacturer, to map the interrelationships among potential determinants of LM success. This study further uses the data from a survey of 122 leading automobile part manufacturers by performing structural equation modeling to empirically test the research model proposed. Findings Management support and commitment, financial resources availability, information technology competence for LM, human resources management, production process simplicity, supportive culture and supply chain-wide integration are the key determinants that directly or indirectly determine the level of achievement of LM success. Research limitations/implications The determinants of LM success as experienced by Asian automobile manufacturers might be different from determinants of LM success as experienced by Western automobile manufacturers. An interesting direction for future research would be to capture the experts' inputs from Western automobile manufacturers to complement the findings of this study. Practical implications The practical contribution of this study lays in the development of linkages among various LM success determinants. Utility of the proposed interpretive structural modeling and structural equation modeling methodologies imposing order, direction and significance of the relationships among elements of LM success assumes considerable value to the decision-makers and LM practitioners. Originality/value Building on opinions of a group of LM experts and a case study of leading auto part manufacturers, the present study strives to model the success of LM, a topic that has received little attention to date.

Abstract
In this work we address the problem of switching the shape of a formation of undistinguishable nonholonomic mobile robots. Each agent moves from the current to its target oriented position using the shortest path. We combine results from previous work on optimal formation switching when the agents are holonomic with results on the structure of the shortest path for nonholonomic agents.