This paper presents an investigation into the dynamic modelling and characterisation of a two-link flexible robot manipulator incorporating a payload. A planar two-link flexible manipulator incorporating structural damping, hub inertia and payload that moves in the horizontal plane is considered. A dynamic model of the system is developed using a combined Euler-Lagrange and assumed mode methods...

In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...

This paper presents the dynamic modelling of a flexible robot manipulator incorporating payload. A planar flexible manipulator incorporating structural damping, hub inertia and payload that moves in the horizontal plane is considered. A dynamic model of the system is developed using a finite element and assumed mode methods (FEM and AMM). In this work will make a comparison between FEM and AMM....

We o er a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the tra c that goes from the speci ed origin to the speci ed destination. The formulation presented here reduces the number of variables and constraints as co...

0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.01.014 ⇑ Tel.: +90 312 290 27 68; fax: +90 312 266 40 54. E-mail address: [email protected] In this paper, we study allocation strategies and their effects on total routing costs in hub networks. Given a set of nodes with pairwise traffic demands, the p-hub median problem is the problem of choosing p nodes as hub loca...

Maritime cabotage is a legislation published by a particular coastal country, which is used to conduct the cargo transportation between its two domestic ports. This paper proposes a two-phase mathematical programming model to formulate the liner hub-and-spoke shipping network design problem subject to the maritime cabotage legislations, i.e., the hub location and feeder allocation problem for p...

Given a graph ( , ) G N E  , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...

We introduce a new NP-complete problem asking if a “query” hypercube is (not) covered by a set of other “evidence” hypercubes. This comes down to a form of constraint reasoning asking for the satisfiability of a CNF formula where the logical atoms are inequalities over single variables, with possibly infinite variable domains. We empirically investigate the location of the phase transition regi...