Write in a clean editor, then format for INFOR Information Systems and Operational Research in one click — DocuGuru applies the official Taylor & Francis template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
INFOR Information Systems and Operational Research is a peer-reviewed journal published by Taylor & Francis, covering Vehicle Routing Optimization Methods, Scheduling and Optimization Algorithms, Advanced Manufacturing and Logistics Optimization.
| Publisher | Taylor & Francis |
|---|---|
| Reference style | Author–year (Chicago, T&F) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." INFOR Information Systems and Operational Research 12 (3): 45–58.
Formats any DOI in INFOR Information Systems and Operational Research style. No sign-up. |
| Publishes research in | Vehicle Routing Optimization Methods Scheduling and Optimization Algorithms Advanced Manufacturing and Logistics Optimization Supply Chain and Inventory Management Advanced Queuing Theory Analysis |
| ISSN | 0315-5986 |
| Citation impact (2-yr) | 1.77 |
| h-index | 61 |
| i10-index | 467 |
| Total citations | 19,771 |
| Top institutions publishing here | University of Toronto |
| Journal website | www.tandfonline.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
AbstractThe paper investigates the infeasibility of super-efficiency data envelopment analysis (DEA) models in which the unit under evaluation is excluded from the reference set. Necessary and sufficient conditions are provided for infeasibility of the super-efficiency DEA measures. By the returns to scale (RTS) classifications obtained from the standard DEA model, we can further locate the…
The shortest path problem with time windows (SPPTW) consists of finding the least cost route between a source and a sink in a network G = (N, A) while respecting specified time windows [ai, bi] at each visited node. The duration dij of each arc is restricted to positive values while the cost Cij of…
The vehicle routing problem with time windows (VRPTW) is an extension of the well-known vehicle routing problem with a central depot. The objective is to design an optimal set of routes that services all customers and satisfies the given constraints, especially the time window constraints. The objective function considered here combines the minimization of the…
Multicriteria problems with a finite set of possible alternatives grouped in clusters or segments are considered. The problem is to select a subset of alternatives evaluated by several criteria and submitted to segmentation constraints between and within the clusters. The basic PROMETHEE-GAIA procedure for multicriteria problems is first briefly recalled. This procedure provides the decisionmaker…
The Generalized Traveling Salesman Problem (GTSP) is a useful model for problems involving decisions of selection and sequence. The problem is defined on a directed graph in which the nodes have been pregrouped into m mutually exclusive and exhaustive nodesets. Arcs are defined only between nodes belonging to different nodesets with each arc having an…
